113 search results - page 1 / 23 » Spanning Trees and Shortest Paths in Monge Graphs |
COMPUTING
1998
13 years 5 months ago
1998
DAM
2000
13 years 5 months ago
2000
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
ICALP
2004
Springer
13 years 11 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
13 years 10 months ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
APPROX
2009
Springer
14 years 10 days ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...