163 search results - page 6 / 33 » Fast Edge-Routing for Large Graphs |
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
108
click to vote
COMGEO
2004
ACM
14 years 11 months ago
2004
ACM
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
GD
2006
Springer
15 years 3 months ago
2006
Springer
We present a novel sampling-based approximation technique for classical multidimensional scaling that yields an extremely fast layout algorithm suitable even for very large graphs....
116
click to vote
DC
2002
14 years 11 months ago
2002
A new general theory about restoration of network paths is first introduced. The theory pertains to restoration of shortest paths in a network following failure, e.g., we prove th...
3DPVT
2006
IEEE
15 years 6 months ago
2006
IEEE
To support real-time computation with large, possibly evolving point clouds and range data, we fit a trimmed uniform tensor-product spline function from one direction. The graph ...