Edge-Connectivity Augmentations of Graphs and Hypergraphs

Zoltán Szigeti ()
Additional contact information
Zoltán Szigeti: CNRS, INPG, UJF, Laboratoire G-SCOP

Chapter 22 in Research Trends in Combinatorial Optimization, 2009, pp 483-521 from Springer

Abstract: Summary 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.

Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-76796-1_22

Ordering information: This item can be ordered from
http://www.springer.com/9783540767961

DOI: 10.1007/978-3-540-76796-1_22

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().