Sampling to provide or to bound: With applications to fully dynamic graph algorithms

DOI<369::AID-RSA5>3.0.CO;2-X 10.1002/(SICI)1098-2418(199712)11:4<369::AID-RSA5>3.0.CO;2-XzbMath0888.68065OpenAlexW2048356005MaRDI QIDQ4372787

Mikkel Thorup, Monika R. Henzinger

Publication date: 13 May 1998

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199712)11:4<369::aid-rsa5>3.0.co;2-x

zbMATH Keywords

dynamic graph algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Faster Fully-Dynamic Minimum Spanning Forest ⋮ Computing the map of geometric minimal cuts ⋮ Decremental SPQR-trees for Planar Graphs ⋮ A fully dynamic algorithm for maintaining the transitive closure

This page was built for publication: Sampling to provide or to bound: With applications to fully dynamic graph algorithms