Algorithm Theory - SWAT 2004
From MaRDI portal
Publication:5315390
DOI10.1007/b98413zbMath1095.68628OpenAlexW2615963353MaRDI QIDQ5315390
Publication date: 7 September 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98413
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
The impact of dynamic events on the number of errors in networks ⋮ Dynamic shortest paths and transitive closure: algorithmic techniques and data structures ⋮ Dynamic Single-Source Shortest Paths in Erdös-Rényi Random Graphs ⋮ Parameterized Weighted Containment ⋮ Unnamed Item ⋮ On dynamic shortest paths problems ⋮ Average update times for fully-dynamic all-pairs shortest paths ⋮ Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. ⋮ Incremental single-source shortest paths in digraphs with arbitrary positive arc weights ⋮ \(f\)-sensitivity distance oracles and routing schemes ⋮ Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs ⋮ Fully dynamic all pairs shortest paths with real edge weights ⋮ Single-source shortest paths and strong connectivity in dynamic planar graphs ⋮ Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization ⋮ Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks
