723 search results - page 5 / 145 » On the hyperbolicity constant in graphs |
VL
2005
IEEE
14 years 29 days ago
2005
IEEE
Abstract— Visualizing software architecture faces the challenges of both data complexity and visual complexity. This paper presents an approach for visualizing software architect...
INFOCOM
2012
IEEE
11 years 9 months ago
2012
IEEE
—We study scalable routing for a sensor network deployed in complicated 3D settings such as underground tunnels in gas system or water system. The nodes are in general 3D space b...
SODA
2001
ACM
13 years 8 months ago
2001
ACM
Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by so-called the "power law". Here we determin...
SODA
2007
ACM
13 years 8 months ago
2007
ACM
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
GD
2003
Springer
14 years 18 days ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...