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
9 - Source Location Problems
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
- Type
- Chapter
- Information
- Algorithmic Aspects of Graph Connectivity , pp. 282 - 303Publisher: Cambridge University PressPrint publication year: 2008