Book contents
- Frontmatter
- Contents
- Preface
- Notation
- 1 Introduction
- 2 Maximum Adjacency Ordering and Forest Decompositions
- 3 Minimum Cuts
- 4 Cut Enumeration
- 5 Cactus Representations
- 6 Extreme Vertex Sets
- 7 Edge Splitting
- 8 Connectivity Augmentation
- 9 Source Location Problems
- 10 Submodular and Posimodular Set Functions
- Bibliography
- Index
Bibliography
Published online by Cambridge University Press: 07 May 2010
- Frontmatter
- Contents
- Preface
- Notation
- 1 Introduction
- 2 Maximum Adjacency Ordering and Forest Decompositions
- 3 Minimum Cuts
- 4 Cut Enumeration
- 5 Cactus Representations
- 6 Extreme Vertex Sets
- 7 Edge Splitting
- 8 Connectivity Augmentation
- 9 Source Location Problems
- 10 Submodular and Posimodular Set Functions
- Bibliography
- Index
Summary
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Abook%3A9780511721649/resource/name/firstPage-9780511721649bib_p357-370_CBO.jpg)
- Type
- Chapter
- Information
- Algorithmic Aspects of Graph Connectivity , pp. 357 - 370Publisher: Cambridge University PressPrint publication year: 2008