1986 search results - page 125 / 398 » Path Separability of Graphs |
108
click to vote
ALENEX
2010
15 years 3 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...
109
click to vote
MVA
1998
15 years 3 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 ...
120
click to vote
ICALP
2004
Springer
15 years 7 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 ...
100
Voted
AGENTS
1997
Springer
15 years 6 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...
134
click to vote
FCT
2007
Springer
15 years 4 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...