Advertisement
Published in:
2009 | OriginalPaper | Chapter
Edge-Connectivity Augmentations of Graphs and Hypergraphs
Author : Zoltán Szigeti
Published in: Research Trends in Combinatorial Optimization
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
A. Frank (Augmenting graphs to meet edge-connectivity requirements, SIAM J. Discrete Math.
5
(1), 22–53, 1992) developed a method to solve edge-connectivity augmentation problems. His paper has stimulated further research in a number of directions, including many interesting generalizations.
This paper surveys the current State of the Art on the edge-connectivity augmentation problem. Recent extensions of the problem are presented for undirected graphs, hypergraphs and more generally for set functions. Shortened proofs are provided for some of the results. A list of open problems is also presented.