A new approach to dynamic all pairs shortest paths
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2004/11/01
-
Journal
-
Indian UGC (journal)
-
Refrences18
-
Citations71
-
Camil Demetrescu Università di Roma "La Sapienza", Rome, Italy
-
Giuseppe F. Italiano Università di Roma "Tor Vergata", Rome, Italy
Abstract
Cite
Demetrescu, Camil, and Giuseppe F. Italiano. “A New Approach to Dynamic All Pairs Shortest Paths”. Journal of the ACM, vol. 51, no. 6, 2004, pp. 968-92, https://doi.org/10.1145/1039488.1039492.
Demetrescu, C., & Italiano, G. F. (2004). A new approach to dynamic all pairs shortest paths. Journal of the ACM, 51(6), 968-992. https://doi.org/10.1145/1039488.1039492
Demetrescu, Camil, and Giuseppe F. Italiano. “A New Approach to Dynamic All Pairs Shortest Paths”. Journal of the ACM 51, no. 6 (2004): 968-92. https://doi.org/10.1145/1039488.1039492.
Demetrescu C, Italiano GF. A new approach to dynamic all pairs shortest paths. Journal of the ACM. 2004;51(6):968-92.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Science
Science (General)
Cybernetics
Information theory
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Semi-dynamic algorithms for maintaining single source shortest paths trees | Algorithmica |
| 1998 | |
| The parametric problem of shortest distances | USSR Computational Mathematics and Mathematical Physics | 17 | 1968 | |
| Updating distances in dynamic graphs | 1985 | |||
| A network evaluation procedure | 1967 | |||
| Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS'99) | 1999 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
Path Algorithms for Contact Sequence Temporal Graphs | Algorithms |
| 2024 | |
A Swell Neural Network Algorithm for Solving Time-Varying Path Query Problems with Privacy Protection | Electronics |
| 2024 | |
The Floyd‐Warshall all‐pairs shortest paths algorithm for disconnected and very sparse graphs | Software: Practice and Experience |
| 2 | 2023 |
| Unit Read-once Refutations for Systems of Difference Constraints | Theory of Computing Systems |
| 2023 | |
Planning spatial networks with Monte Carlo tree search | Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences |
| 2023 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 46
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 all pairs shortest path algorithms and was published in 2006. The most recent citation comes from a 2024 study titled Path Algorithms for Contact Sequence Temporal Graphs. This article reached its peak citation in 2022, with 8 citations. It has been cited in 46 different journals, 6% of which are open access. Among related journals, the SIAM Journal on Computing cited this research the most, with 8 citations. The chart below illustrates the annual citation trends for this article.