Edge-connectivity augmentation of graphs over symmetric parity families

DOI10.1016/j.disc.2007.11.054zbMath1189.05092OpenAlexW2013326192MaRDI QIDQ998390

Zoltán Szigeti

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.054

zbMATH Keywords

edge-connectivity augmentation problemminimum \(T\)-cut augmentation problemparity families

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (3)

Edge-Connectivity Augmentations of Graphs and Hypergraphs ⋮ Augmenting edge-connectivity between vertex subsets ⋮ Signed Graphs: From Modulo Flows to Integer-Valued Flows

Cites Work

• Edge-connectivity augmentation problems
• Minimum \(T\)-cuts and optimal \(T\)-pairings
• Minimizing submodular functions over families of sets
• Edge-Connectivity Augmentations of Graphs and Hypergraphs
• Circular flows of nearly Eulerian graphs and vertex-splitting
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• A Reduction Method for Edge-Connectivity in Graphs

This page was built for publication: Edge-connectivity augmentation of graphs over symmetric parity families