Faster Shortest-Path Algorithms for Planar Graphs
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date1997/08/01
-
Indian UGC (journal)
-
Refrences28
-
Citations118
-
Monika R Henzinger
-
Philip Klein
-
Satish Rao
-
Sairam Subramanian
Cite
Henzinger, Monika R, et al. “Faster Shortest-Path Algorithms for Planar Graphs”. Journal of Computer and System Sciences, vol. 55, no. 1, 1997, pp. 3-23, https://doi.org/10.1006/jcss.1997.1493.
Henzinger, M. R., Klein, P., Rao, S., & Subramanian, S. (1997). Faster Shortest-Path Algorithms for Planar Graphs. Journal of Computer and System Sciences, 55(1), 3-23. https://doi.org/10.1006/jcss.1997.1493
Henzinger, Monika R, Philip Klein, Satish Rao, and Sairam Subramanian. “Faster Shortest-Path Algorithms for Planar Graphs”. Journal of Computer and System Sciences 55, no. 1 (1997): 3-23. https://doi.org/10.1006/jcss.1997.1493.
Henzinger MR, Klein P, Rao S, Subramanian S. Faster Shortest-Path Algorithms for Planar Graphs. Journal of Computer and System Sciences. 1997;55(1):3-23.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Planar Separators and Parallel Polygon Triangulation | Journal of Computer and System Sciences |
| 28 | 1995 |
| Scaling Algorithms for the Shortest Path Problem | SIAM Journal on Computing |
| 1995 | |
| Faster approximation algorithms for the unit capacity concurrent-flow problem with applications to routing and finding sparse cuts | SIAM Journal on Computing |
| 1994 | |
| An Optimal Algorithm for Selection in a Min-Heap | Information and Computation |
| 19 | 1993 |
Faster algorithms for the shortest path problem | Journal of the ACM |
| 195 | 1990 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
How vulnerable is an undirected planar graph with respect to max flow | Networks |
| 2024 | |
Path Planning in a Weighted Planar Subdivision Under the Manhattan Metric | Graphs and Combinatorics |
| 2024 | |
| Non-crossing shortest paths lengths in planar graphs in linear time | Discrete Applied Mathematics |
| 1 | 2024 |
Continuous Mean Distance of a Weighted Graph | Results in Mathematics |
| 1 | 2023 |
| Minimum Cuts in Surface Graphs | SIAM Journal on Computing |
| 2023 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 58
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Experimental analysis of dynamic algorithms for the single source shortest paths problem and was published in 1998. The most recent citation comes from a 2024 study titled Path Planning in a Weighted Planar Subdivision Under the Manhattan Metric. This article reached its peak citation in 2010, with 14 citations. It has been cited in 50 different journals, 6% of which are open access. Among related journals, the ACM Transactions on Algorithms cited this research the most, with 13 citations. The chart below illustrates the annual citation trends for this article.