Edge-Connectivity Augmentations of Graphs and Hypergraphs
From MaRDI portal
Publication:2971622
DOI10.1007/978-3-540-76796-1_22zbMath1359.05067OpenAlexW2209699949MaRDI QIDQ2971622
Publication date: 7 April 2017
Published in: Research Trends in Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-76796-1_22
Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items (9)
The Generalized Terminal Backup Problem ⋮ Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph ⋮ Augmenting edge-connectivity between vertex subsets ⋮ Covering symmetric semi-monotone functions ⋮ Augmenting the Edge‐Connectivity of a Hypergraph by Adding a Multipartite Graph ⋮ Edge-splittings preserving local edge-connectivity of graphs ⋮ Edge-connectivity augmentation of graphs over symmetric parity families ⋮ The \((2, k)\)-connectivity augmentation problem: algorithmic aspects ⋮ Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Covering symmetric supermodular functions by uniform hypergraphs
- Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
- Local edge-connectivity augmentation in hypergraphs is NP-complete
- Edge-connectivity augmentation of graphs over symmetric parity families
- Edge-connectivity augmentation problems
- On a theorem of Mader
- Augmenting hypergraphs by edges of size two
- Covering symmetric supermodular functions by graphs
- Coverings and structure of crossing families
- Hypergraph connectivity augmentation
- Successive edge-connectivity augmentation problems
- Covering symmetric semi-monotone functions
- Edge-splittings preserving local edge-connectivity of graphs
- Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
- The minimum augmentation of any graph to aK-edge-connected graph
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Augmentation Problems
- A Reduction Method for Edge-Connectivity in Graphs
- Edge-Connectivity Augmentation Preserving Simplicity
- Edge-Connectivity Augmentation with Partition Constraints
- Detachments Preserving Local Edge-Connectivity of Graphs
- Constrained Edge-Splitting Problems
- Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph
- Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
- Detachment of Vertices of Graphs Preserving Edge-Connectivity
This page was built for publication: Edge-Connectivity Augmentations of Graphs and Hypergraphs
