Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks
From MaRDI portal
Publication:2864176
DOI10.1016/j.entcs.2006.11.006zbMath1277.68024OpenAlexW2069538156WikidataQ61609560 ScholiaQ61609560MaRDI QIDQ2864176
Camil Demetrescu, Giuseppe F. Italiano
Publication date: 6 December 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2006.11.006
Network design and communication in computer systems (68M10) Paths and cycles (05C38) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- On the ratio of optimal integral and fractional covers
- Semidynamic algorithms for maintaining single-source shortest path trees
- On the computational complexity of dynamic graph problems
- Fully dynamic all pairs shortest paths with real edge weights
- Maintaining Minimum Spanning Forests in Dynamic Graphs
- Randomized fully dynamic graph algorithms with polylogarithmic time per operation
- High-Probability Parallel Transitive-Closure Algorithms
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- Worst-case update times for fully-dynamic all-pairs shortest paths
- A Greedy Heuristic for the Set-Covering Problem
- An On-Line Edge-Deletion Problem
- Incremental algorithms for minimal length paths
- An Incremental Algorithm for a Generalization of the Shortest-Path Problem
- Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
- Algorithm Theory - SWAT 2004
- A new approach to dynamic all pairs shortest paths
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- The parametric problem of shortest distances
- Faster shortest-path algorithms for planar graphs
This page was built for publication: Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks
