Hiroshi Nagamochi, Toshihide Ibaraki

Algorithmic Aspects of Graph Connectivity

• Gebundenes Buch

Produktbeschreibung

The first really thorough book to discuss this central notion in graph and network theory, emphasizing its algorithmic aspects.

Produktdetails

• Verlag: Cambridge University Press
• Seitenzahl: 392
• Erscheinungstermin: 2. Juli 2010
• Englisch
• Abmessung: 240mm x 161mm x 26mm
• Gewicht: 754g
• ISBN-13: 9780521878647
• ISBN-10: 0521878640
• Artikelnr.: 24814476

Autorenporträt

Hiroshi Nagamochi is a professor at the Graduate School of Informatics, Kyoto University, Japan. He is a member of the Operations Research Society of Japan and the Information Processing Society.

Inhaltsangabe

1. Introduction
2. MA 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 posi-modular set functions.