Maintaining the classes of 4-edge-connectivity in a graph on-line
From MaRDI portal
Publication:1386336
DOI10.1007/PL00009195zbMath0896.68104OpenAlexW1983754496MaRDI QIDQ1386336
Publication date: 1 October 1998
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009195
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items (4)
Linear time algorithms for two disjoint paths problems on directed acyclic graphs ⋮ Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs ⋮ Dynamic bottleneck optimization for \(k\)-edge and 2-vertex connectivity ⋮ Connectivity Oracles for Graphs Subject to Vertex Failures
This page was built for publication: Maintaining the classes of 4-edge-connectivity in a graph on-line
