1986 search results - page 125 / 398 » Path Separability of Graphs |
ALENEX
2010
13 years 10 months ago
2010
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy...
MVA
1998
13 years 10 months ago
1998
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
ICALP
2004
Springer
14 years 2 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 ...
AGENTS
1997
Springer
14 years 1 months ago
1997
Springer
Abstract. We present a purely vision-based scheme for learning a topological representation of an open environment. The system represents selected places by local views of the surr...
FCT
2007
Springer
13 years 10 months ago
2007
Springer
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...