A unifying approach to splitting-off
From MaRDI portal
Publication:2448935
Recommendations
- A New Approach to Splitting-Off
- Covering symmetric supermodular functions by uniform hypergraphs
- Covering skew-supermodular functions by hypergraphs of minimum total size
- Covering symmetric supermodular functions by graphs
- Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph
Cites work
- A New Approach to Splitting-Off
- A Reduction Method for Edge-Connectivity in Graphs
- Approximating connectivity augmentation problems
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Covering symmetric semi-monotone functions
- Covering symmetric supermodular functions by graphs
- Hypergraph connectivity augmentation
- Local edge-connectivity augmentation in hypergraphs is NP-complete
- Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
- On a theorem of Mader
- Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
Cited in
(11)- Covering skew-supermodular functions by hypergraphs of minimum total size
- The transition to unigroups
- Minimal edge-coverings of pairs of sets
- Approximation algorithms for connectivity augmentation problems
- A strategic approach to multiple estate division problems
- The generalized terminal backup problem
- A New Approach to Splitting-Off
- Covering symmetric supermodular functions by uniform hypergraphs
- Approximation algorithms for node and element connectivity augmentation problems
- Splitting-off in hypergraphs
- Splitting-off in hypergraphs
This page was built for publication: A unifying approach to splitting-off
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448935)