2137 search results - page 53 / 428 » Experiments on Graph Clustering Algorithms |
SAC
2009
ACM
14 years 2 months ago
2009
ACM
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...
WEA
2005
Springer
14 years 1 months ago
2005
Springer
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...
TVCG
2008
13 years 7 months ago
2008
Graphs have been widely used to model relationships among data. For large graphs, excessive edge crossings make the display visually cluttered and thus difficult to explore. In thi...
WSC
2004
13 years 9 months ago
2004
Simulation methods are extensively used in modeling complex scheduling problems. However, traditional layout of simulation models can become complicated when they are used to find...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...