A unifying approach to splitting-off

DOI10.1007/s00493-012-2548-8zbMath1299.90276OpenAlexW1990126996MaRDI QIDQ2448935

Attila Bernáth, Tamás Király

Publication date: 5 May 2014

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10831/10592

zbMATH Keywords

combinatorial optimizationconnectivitygraph algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (2)

The Generalized Terminal Backup Problem ⋮ Approximation algorithms for connectivity augmentation problems

Cites Work

• Unnamed Item
• Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
• Local edge-connectivity augmentation in hypergraphs is NP-complete
• On a theorem of Mader
• Covering symmetric supermodular functions by graphs
• Hypergraph connectivity augmentation
• Covering symmetric semi-monotone functions
• A New Approach to Splitting-Off
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• A Reduction Method for Edge-Connectivity in Graphs
• Preserving and Increasing Local Edge-Connectivity in Mixed Graphs

This page was built for publication: A unifying approach to splitting-off