Hiroshi Nagamochi, Toshihide Ibaraki

Algorithmic Aspects of Graph Connectivity

• Broschiertes Buch

Produktdetails

• Verlag: Cambridge University Press
• Seitenzahl: 392
• Erscheinungstermin: 18. Januar 2019
• Englisch
• Abmessung: 234mm x 156mm x 21mm
• Gewicht: 594g
• ISBN-13: 9781108735490
• ISBN-10: 1108735495
• Artikelnr.: 56522353

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.