436 search results - page 66 / 88 » Lombardi Drawings of Graphs |
153
click to vote
ICDM
2008
IEEE
16 years 6 days ago
2008
IEEE
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
165
click to vote
APWEB
2005
Springer
15 years 11 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...
216
click to vote
ICTAI
2008
IEEE
16 years 5 days 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...
135
click to vote
IFIPTCS
2010
15 years 3 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...
185
click to vote
RSA
2011
15 years 21 days 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...