Generalized cut trees for edge-connectivity
- 20 November 2023
- journal article
- research article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 165, 47-67
Abstract
No abstract availableKeywords
Funding Information
- Deutsche Forschungsgemeinschaft
This publication has 9 references indexed in Scilit:
- Compact cactus representations of all non-trivial min-cutsDiscrete Applied Mathematics, 2021
- Minimum cuts in near-linear timeJournal of the ACM, 2000
- A simple min-cut algorithmJournal of the ACM, 1997
- On the number of small cuts in a graphInformation Processing Letters, 1996
- Computing Edge-Connectivity in Multigraphs and Capacitated GraphsSIAM Journal on Discrete Mathematics, 1992
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic HypergraphsSIAM Journal on Computing, 1984
- Kantendisjunkte Wege in GraphenMonatshefte für Mathematik, 1974
- Grad und lokaler Zusammenhang in endlichen GraphenMathematische Annalen, 1973
- Existenz gewisser Konfigurationen inn-gesättigten Graphen und in Graphen genügend großer KantendichteMathematische Annalen, 1971