Average-case analysis of dynamic graph algorithms

DOI10.1007/PL00009186zbMath0895.68104OpenAlexW3138175242MaRDI QIDQ1386353

D. Alberts, Monika R. Henzinger

Publication date: 8 September 1998

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009186

zbMATH Keywords

maximum cardinality matchingminimum spanning forestdynamic graph algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items

Maintaining dynamic minimum spanning trees: an experimental study