Local edge-connectivity augmentation in hypergraphs is NP-complete
From MaRDI portal
Publication:968204
DOI10.1016/J.DAM.2009.12.011zbMATH Open1225.05191OpenAlexW2072785948MaRDI QIDQ968204FDOQ968204
Authors: Zoltán Király, Ben Cosh, Bill Jackson
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.12.011
Recommendations
- Edge-augmentation of hypergraphs
- Graph-Theoretic Concepts in Computer Science
- Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
- Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
- On the minimum local-vertex-connectivity augmentation in graphs
Cites Work
- Title not available (Why is that?)
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Minimal edge-coverings of pairs of sets
- Independence free graphs and vertex connectivity augmentation
- Combinatorial optimization. Theory and algorithms
- Edge-connection of graphs, digraphs, and hypergraphs
- Edge-connectivity augmentation problems
- Covering symmetric supermodular functions by graphs
- On the minimum local-vertex-connectivity augmentation in graphs
- Augmenting hypergraphs by edges of size two
- Approximating connectivity augmentation problems
- Hypergraph connectivity augmentation
- Covering symmetric supermodular functions by uniform hypergraphs
- Successive edge-connectivity augmentation problems
- Detachments Preserving Local Edge-Connectivity of Graphs
Cited In (9)
- A New Approach to Splitting-Off
- The generalized terminal backup problem
- Sufficient conditions for maximally edge-connected hypergraphs
- A unifying approach to splitting-off
- Approximation algorithms for connectivity augmentation problems
- Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
- Approximation algorithms for node and element connectivity augmentation problems
- Title not available (Why is that?)
- Edge-connectivity augmentations of~graphs~and~hypergraphs
This page was built for publication: Local edge-connectivity augmentation in hypergraphs is NP-complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968204)