514 search results - page 81 / 103 » Drawing a Graph in a Hypercube |
APWEB
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents a new method for visualizing and navigating huge graphs. The main feature of this method is that it applies Level-Of-Detail (LOD) strategy to graph visualizati...
122
click to vote
ICTAI
2008
IEEE
15 years 4 months ago
2008
IEEE
Frequent patterns in program executions represent recurring sequences of events. These patterns can be used to reveal the hidden structures of a program, and ease the comprehensio...
IFIPTCS
2010
14 years 7 months ago
2010
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
RSA
2011
14 years 4 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...
144
click to vote
CGF
2011
14 years 1 months ago
2011
Maintaining both overview and detail while navigating in graphs, such as road networks, airline route maps, or social networks, is difficult, especially when targets of interest ...