219 search results - page 41 / 44 » Drawing with Fat Edges |
JGAA
2007
13 years 7 months ago
2007
The cluster structure of many real-world graphs is of great interest, as the clusters may correspond e.g. to communities in social networks or to cohesive modules in software syst...
IV
2010
IEEE
13 years 5 months ago
2010
IEEE
—Networks are widely used in modeling relational data often comprised of thousands of nodes and edges. This kind of data alone implies a challenge for its visualization as it is ...
JGT
2010
13 years 5 months ago
2010
The crossing number, cr(G), of a graph G is the least number of crossing points in any drawing of G in the plane. According to the Crossing Lemma of Ajtai, Chv´atal, Newborn, Sze...
ISVC
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. In this paper, we incorporated the global convex segmentation method and the split Bregman technique into the region-scalable fitting energy model. The new proposed metho...
RSA
2011
13 years 2 months ago
2011
We study the cover time of random geometric graphs. Let I(d) = [0, 1]d denote the unit torus in d dimensions. Let D(x, r) denote the ball (disc) of radius r. Let Υd be the volume...