521 search results - page 1 / 105 » Coring method for clustering a graph |
ICPR
2008
IEEE
14 years 6 months ago
2008
IEEE
APVIS
2006
13 years 6 months ago
2006
We introduce a class of graphs called an intersecting clustered graph that is a clustered graph with intersections among clusters. We propose a novel method for nicely drawing the...
CLUSTER
2002
IEEE
13 years 9 months ago
2002
IEEE
Clusters have made the jump from lab prototypes to fullfledged production computing platforms. The number, variety, and specialized configurations of these machines are increasi...
GD
2005
Springer
13 years 10 months ago
2005
Springer
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
COMBINATORICS
2006
13 years 4 months ago
2006
We give a new derivation of the threshold of appearance of the k-core of a random graph. Our method uses a hybrid model obtained from a simple model of random graphs based on rand...