39 search results - page 5 / 8 » Dynamic Multi-level Overlay Graphs for Shortest Paths |
ICALP
1995
Springer
13 years 11 months ago
1995
Springer
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be ef...
ICCV
2007
IEEE
14 years 1 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
GCC
2005
Springer
14 years 1 months ago
2005
Springer
Building a topology-aware peer-to-peer overlay network can bring many advantages, such as providing locality-aware connectivity and reducing routing path length. While its benefit...
ESOP
2006
Springer
13 years 11 months ago
2006
Springer
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...
CORR
1999
Springer
13 years 7 months ago
1999
Springer
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...