Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation

DOI10.1006/jagm.1999.1040zbMath0946.68104OpenAlexW2028942728MaRDI QIDQ4939604

Ramakrishna Thurimella, Joseph Cheriyan

Publication date: 17 October 2000

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1999.1040

zbMATH Keywords

\(k\)-separator\(k\)-shredder

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

Global and fixed-terminal cuts in digraphs ⋮ Power optimization for connectivity problems ⋮ The firebreak problem ⋮ On shredders and vertex connectivity augmentation ⋮ Graph connectivity and its augmentation: Applications of MA orderings ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ Independence free graphs and vertex connectivity augmentation ⋮ Edges not contained in triangles and the number of contractible edges in a 4-connected graph

This page was built for publication: Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation