Mincut sensitivity data structures for the insertion of an edge
From MaRDI portal
Publication:2165037
DOI10.1007/s00453-022-00978-0OpenAlexW4281566921MaRDI QIDQ2165037
Till Knollmann, Surender Baswana, Shiv K. Gupta
Publication date: 18 August 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-00978-0
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The level ancestor problem simplified
- An efficient strongly connected components algorithm in the fault tolerant model
- Facet identification for the symmetric traveling salesman polytope
- Fully-dynamic min-cut
- Dynamically switching vertices in planar graphs
- A data structure for dynamic trees
- Fault tolerant additive and \((\mu, \alpha)\)-spanners
- Dynamic Connectivity: Connecting to Networks and Geometry
- Tight Bounds for Gomory-Hu-like Cut Counting
- Maximal Flow Through a Network
- Very Simple Methods for All Pairs Network Flow Analysis
- Oracles for Distances Avoiding a Failed Node or Link
- 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
- The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case
- Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time
- Fault-Tolerant Approximate BFS Structures
- Connectivity Oracles for Graphs Subject to Vertex Failures
- Fast and Simple Fully-Dynamic Cut Tree Construction
- Sparse Fault-Tolerant BFS Structures
- Distance sensitivity oracles with subcubic preprocessing time and fast query time
- A nearly optimal oracle for avoiding failed vertices and edges
- Fault Tolerant Spanners for General Graphs
- The Transitive Reduction of a Directed Graph
- Subcubic algorithms for Gomory–Hu tree in unweighted graphs
This page was built for publication: Mincut sensitivity data structures for the insertion of an edge
