Mincut Sensitivity Data Structures for the Insertion of an Edge
From MaRDI portal
Publication:5874478
DOI10.4230/LIPIcs.ESA.2020.12OpenAlexW3081916949MaRDI QIDQ5874478
Surender Baswana, Till Knollmann, Shiv K. Gupta
Publication date: 7 February 2023
Full work available at URL: https://doi.org/10.4230/LIPIcs.ESA.2020.12
Cites Work
- The level ancestor problem simplified
- Fully-dynamic min-cut
- Tight Bounds for Gomory-Hu-like Cut Counting
- Maximal Flow Through a Network
- Very Simple Methods for All Pairs Network Flow Analysis
- An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs
- Multi-Terminal Network Flows
- On the structure of all minimum cuts in a network and applications
- Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time
- Fast and Simple Fully-Dynamic Cut Tree Construction
- The Transitive Reduction of a Directed Graph