scientific article; zbMATH DE number 910887
From MaRDI portal
Publication:4886061
zbMath0848.05058MaRDI QIDQ4886061
D. Alberts, Monika R. Henzinger
Publication date: 22 August 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
connectivityrandom graphminimum spanning forestsbipartitenessmaximum cardinality matchingdynamic graph algorithmsupdate operation
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Average case analysis of dynamic geometric optimization ⋮ Convex transversals ⋮ Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time ⋮ Fully Dynamic Maximal Matching in $O(\log n)$ Update Time