723 search results - page 3 / 145 » On the hyperbolicity constant in graphs |
GD
2008
Springer
13 years 8 months ago
2008
Springer
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
BMCBI
2004
13 years 7 months ago
2004
Background: Common existing phylogenetic tree visualisation tools are not able to display readable trees with more than a few thousand nodes. These existing methodologies are base...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
TON
2008
13 years 7 months ago
2008
Estimating distances in the Internet has been studied in the recent years due to its ability to improve the performance of many applications, e.g., in the peer-topeer realm. One sc...
VRML
1995
ACM
13 years 11 months ago
1995
ACM
We visualize the structure of sections of the World Wide Web by constructing graphical representations in 3D hyperbolic space. The felicitous property that hyperbolic space has ...