A fully dynamic approximation scheme for shortest paths in planar graphs
From MaRDI portal
Publication:1273930
DOI10.1007/PL00009223zbMath0915.68130MaRDI QIDQ1273930
Sairam Subramanian, Philip N. Klein
Publication date: 6 January 1999
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009223
68R10: Graph theory (including graph drawing) in computer science
Related Items
Unnamed Item, Dynamic Approximate Vertex Cover and Maximum Matching, Unnamed Item, Shortest-path queries in static networks, Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time, Unnamed Item, Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs., Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs, Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs, Single-source shortest paths and strong connectivity in dynamic planar graphs, Distributed distance computation and routing with small messages, A survey on combinatorial optimization in dynamic environments