Monika R. Henzinger, Philip N. Klein, Satish Rao, and Sairam Subramanian. Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci., 55(1):3--23, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
mproved Bounds and New Trade-Offs for Dynamic All Pairs.. - Demetrescu (Correct)
....model. Again, in the worst case the running times of output bounded dynamic algorithms are comparable to recomputing APSP from scratch. Recently several dynamic shortest path algorithms, which are provably faster than recomputing APSP from scratch, were proposed. In particular, Henzinger et al. [15] designed a fully dynamic algorithm for APSP on planar graphs with integer weights, with a running time of O(n 9=7 log(nC) per edge insertion or deletion. This bound has been improved by Fakcharoemphol and Rao in [6] who designed a fully dynamic algorithm for single source shortest paths in ....
M.R. Henzinger, P. Klein, S. Rao, and S. Subramanian. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences, 55(1):3--23, August 1997.
A New Approach to Dynamic All Pairs Shortest Paths - Demetrescu, Italiano (2002) (6 citations) (Correct)
....only worked on graphs with small integer weights. In particular, Ausiello et al. 1] proposed a decrease only shortest path algorithm for directed graphs having positive integer weights less than C: the amortized running time of their algorithm is O(Cn log n) per edge insertion. Henzinger et al. [12] designed a fully dynamic algorithm for APSP on planar graphs with integer weights, with a running time of O(n 4=3 log(nC) per operation. This bound has been improved by Fakcharoemphol and Rao in [7] who designed a fully dynamic algorithm for single source shortest paths in planar directed ....
M.R. Henzinger, P. Klein, S. Rao, and S. Subramanian. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences, 55(1):3-23, August 1997.
Undirected Single Source Shortest Paths in Linear Time - Thorup (1997) (19 citations) (Correct)
....d(v) dist(s; v) from s to v. This is one of the classic problems in algorithmic graph theory. In this paper, we present a determinstic linear time and linear space algorithm for undirected SSSP with integer weights. So far a linear time SSSP algorithm has only been known for planar graphs [KRRS97]. Our algorithm runs on a RAM, which models what we program in imperative programming languages such as C. The memory is divided into addressable words of length w. Addresses are themselves contained in words, so w log n. Moreover, we have a constant number of registers, each with capacity for ....
M.R. Henzinger, P. Klein, S. Rao, and S. Subramanian. Faster Shortest-Path Algorithms for Planar Graphs. J. Comp. Syst. Sc. 53 (1997) 2--23. See also STOC'94. 15
Fully Dynamic All Pairs Shortest Paths with Real Edge Weights - Demetrescu, Italiano (2001) (3 citations) (Correct)
....they only work on graphs with small integer weights. In particular, Ausiello et al. 3] proposed an incremental shortest path algorithm for directed graphs having positive integer weights less than C: the amortized running time of their algorithm is O(Cn log n) per edge insertion. Henzinger et al. [22] designed a fully dynamic algorithm for APSP on planar graphs with integer weights, with a running time of O(n 9 7 log(nC) per operation. This bound has been improved by Fakcharoemphol and Rao in [11] who designed a fully dynamic algorithm for single source shortest paths in planar directed ....
M.R. Henzinger, P. Klein, S. Rao, and S. Subramanian. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences, 55(1):3--23, August 1997.
How to Draw the Minimum Cuts of a Planar Graph (Extended.. - Brandes, Cornelsen.. (2001) (Correct)
.... (V i ; V j ) 0 if i j 6 1 mod k: Fleischer [5] showed that the cactus of all minimum cuts of a weighted graph can be constructed in O(mn log n 2 m ) time. For an unweighted graph, it can be computed in O( n 2 ) time [12] Using the linear time shortest path algorithm of Henzinger et al. [7] for max ow computations, the cactus of a weighted planar graph can be obtained in O(n 2 ) time with the construction described in [5] 3 Hierarchically Clustered Graphs Feng et al. 4] introduced the hierarchically clustered graph model and characterized graphs that have a planar drawing ....
M. R. Henzinger, P. Klein, S. Rao, and S. Subramanian. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences, 55:3-23,
Fully Dynamic All Pairs Shortest Paths with Real Edge Weights - Demetrescu, Italiano (2001) (3 citations) (Correct)
....they only work on graphs with small integer weights. In particular, Ausiello et al. 3] proposed an incremental shortest path algorithm for directed graphs having positive integer weights less than C: the amortized running time of their algorithm is O(Cn log n) per edge insertion. Henzinger et al. [13] designed a fully dynamic algorithm for APSP on planar graphs with integer weights, with a running time of O(n 9=7 log(nC) per operation. King [14] presented a fully dynamic algorithm for maintaining all pairs shortest paths in directed graphs with positive integer weights less than C: the ....
M.R. Henzinger, P. Klein, S. Rao, and S. Subramanian. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences, 55(1):3-23, August 1997.
Proximity Search in Databases - Goldman, Shivakumar.. (1998) (41 citations) (Correct)
....in size. See [GSVGM98] for more detail. There exist linear time algorithms that compute balanced separators for graphs of constant treewidth [Bod96] and for planar graphs [LT80] It can be shown that a balanced separator yields an optimal graph decomposition for in memory distance queries [HKRS94, CZ95, Pel97] Hence, balanced separators would be ideal candidates for hubs. For tree shaped data, such as HTML or XML [Con97] documents, we can use the aforementioned tree based separator algorithm to generate hubs. Unfortunately, for arbitrary graphs, a nontrivial balanced separator theorem ....
M. Henzinger, P. Klein, S. Rao, and S. Subramanian. Faster shortest-path algorithms for planar graphs. In 26th Annual ACM Symposium on Theory of Computing, Montreal, Quebec. Canada, May 1994.
Planar Graphs, Negative Weight Edges, Shortest Paths, and.. - Fakcharoenphol, Rao Self-citation (Rao) (Correct)
No context found.
Monika R. Henzinger, Philip N. Klein, Satish Rao, and Sairam Subramanian. Faster Shortest-Path Algorithms for Planar Graphs. Journal of Computer and System Sciences, 55(1):3--23, 1997.
Computing Shortest Non-Trivial Cycles on Orientable Surfaces of.. - Kutz (2005) (Correct)
No context found.
Monika R. Henzinger, Philip N. Klein, Satish Rao, and Sairam Subramanian. Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci., 55(1):3--23, 1997.
Efficient Optimal Search of Euclidean-Cost Grids and Lattices - Kuffner (2004) (Correct)
No context found.
M. Henzinger, P. Klein, and S. Rao, "Faster shortest-path algorithms for planar graphs," J. Comput. Syst. Sci, vol. 55, pp. 3--23, 1997.
Geometric Travel Planning - Edelkamp, Jabbar, Willhalm (2003) (Correct)
No context found.
M. R. Henzinger, P. Klein, S. Rao, and S. Subramanian, "Faster shortestpath algorithms for planar graphs," Journal of Computer and System Sciences, vol. 55, no. 1, pp. 3--23, 1997.
Geometric Travel Planning - Edelkamp, Jabbar, l. (2003) (Correct)
No context found.
M. R. Henzinger, P. Klein, S. Rao, and S. Subramanian, "Faster shortestpath algorithms for planar graphs," Journal of Computer and System Sciences, vol. 55, no. 1, pp. 3--23, 1997.
Exact and Approximate Distances in Graphs - a survey - Zwick (2001) (8 citations) (Correct)
No context found.
M.R. Henzinger, P. Klein, S. Rao, and S. Subramanian. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences, 55:3-23, 1997.
Geometric Travel Planning - Edelkamp, Jabbar, al. (2003) (Correct)
No context found.
M. R. Henzinger, P. Klein, S. Rao, and S. Subramanian, "Faster shortestpath algorithms for planar graphs," Journal of Computer and System Sciences, vol. 55, no. 1, pp. 3--23, 1997.
A New Approach to - Dynamic All Pairs (Correct)
No context found.
M.R. Henzinger, P. Klein, S. Rao, and S. Subramanian. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences, 55(1):3--23, August 1997.
A Shortest Path Algorithm for Real-Weighted Undirected Graphs - Pettie, Ramachandran (2002) (Correct)
No context found.
M. R. Henzinger, P. N. Klein, S. Rao, S. Subramanian. Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci. 55 (1997), no. 1, 3-23.
A Faster Algorithm for Computing Minimum 5-Way and.. - Nagamochi, Katayana.. (1999) (1 citation) (Correct)
No context found.
M. R. Henzinger, P. Klein, S. Rao and D. Williamson, Faster shortest-path algorithms for planar graphs, J. Comp. Syst. Sc., vol. 53, (1997), pp. 2-23.
Computing Shortest Paths with Comparisons and Additions - Pettie, Ramachandran (2002) (4 citations) (Correct)
No context found.
M. R. Henzinger, P. N. Klein, S. Rao, S. Subramanian. Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci. 55 (1997), no. 1, 3-23.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC