90 search results - page 1 / 18 » Finding the Most Vital Node of a Shortest Path |
COCOON
2001
Springer
13 years 9 months ago
2001
Springer
In an undirected, 2-node connected graph G = (V, E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in ...
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
CORR
2011
Springer
12 years 11 months ago
2011
Springer
— this paper presents an enhancement of the medial axis algorithm to be used for finding the optimal shortest path for developed cognitive map. The cognitive map has been develop...
EDBT
2008
ACM
14 years 4 months ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
W2GIS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...