The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case

DOI10.1137/S0097539797330045zbMath0966.68154OpenAlexW2054698857MaRDI QIDQ4507372

Yefim Dinitz, A. D. Vaĭnshteĭn

Publication date: 18 October 2000

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539797330045

zbMATH Keywords

dynamic algorithmsedge-connectivitygraph structuresminimum cutsincremental maintenance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Connectivity (05C40)

Related Items (1)

Mincut sensitivity data structures for the insertion of an edge

This page was built for publication: The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case