Fully-dynamic min-cut
From MaRDI portal
Publication:925139
DOI10.1007/s00493-007-0045-2zbMath1135.68024OpenAlexW2611854190MaRDI QIDQ925139
Publication date: 29 May 2008
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-007-0045-2
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (16)
Mincut sensitivity data structures for the insertion of an edge ⋮ Incremental algorithm for maintaining a DFS tree for undirected graphs ⋮ On Dynamic DFS Tree in Directed Graphs ⋮ Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs ⋮ Mincut Sensitivity Data Structures for the Insertion of an Edge ⋮ LP Relaxation and Tree Packing for Minimum $k$-Cut ⋮ Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version) ⋮ Unnamed Item ⋮ On finding fundamental cut sets ⋮ Dynamic graph coloring ⋮ Randomization for Efficient Dynamic Graph Algorithms ⋮ Computing minimum multiway cuts in hypergraphs ⋮ Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier ⋮ Fully Dynamic Maximal Matching in $O(\log n)$ Update Time ⋮ I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs ⋮ Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time
This page was built for publication: Fully-dynamic min-cut
