561 search results - page 27 / 113 » Shortest-Path Kernels on Graphs |
ICALP
2004
Springer
15 years 4 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
COCOON
1999
Springer
15 years 3 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
IPL
2010
14 years 9 months ago
2010
We present an O(n) Breadth-First Search algorithm for trapezoid graphs, which takes as input a trapezoid model and any priority order on the vertices. Our algorithm is the first ...
100
click to vote
JCO
2006
14 years 11 months ago
2006
Reliability is a very important issue in Mobile Ad hoc NETworks (MANETs). Shortest paths are usually used to route packets in MANETs. However, a shortest path may fail quickly, bec...
ICCV
2007
IEEE
15 years 5 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...