Algorithmic aspects of graph connectivity / Hiroshi Nagamochi, Toshihide Ibaraki.
Saved in:
| Online Access: |
Full Text (via Cambridge) |
|---|---|
| Main Author: | |
| Other Authors: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cambridge ; New York :
Cambridge University Press,
2008.
|
| Series: | Encyclopedia of mathematics and its applications ;
v. 123. |
| Subjects: |
Table of Contents:
- Maximum adjacency ordering and forest decompositions
- Minimum cuts
- Cut enumeration
- Cactus representations
- Extreme vertex sets
- Edge splitting
- Connectivity augmentation
- Source location problems
- Submodular and posimodular set functions.