External Links

    Journal: Algorithmica

    Volume 22, Issue 3

    235 -- 249Philip N. Klein, Sairam Subramanian. A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs
    250 -- 274Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni. Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees
    275 -- 304Giuseppe F. Italiano, Rajiv Ramaswami. Maintaining Spanning Trees of Small Diameter
    305 -- 329Bala Swaminathan, Kenneth J. Goldman. An Incremental Distributed Algorithm for Computing Biconnected Components in Dynamic Graphs
    330 -- 350Greg N. Frederickson. Maintaining Regular Properties Dynamically in ::::k::::-Terminal Graphs
    351 -- 362Monika Rauch Henzinger, Michael L. Fredman. Lower Bounds for Fully Dynamic Connectivity Problems in Graphs
    runs on