Algorithmic Aspects of Graph Connectivity

List of contents

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.

About the author

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.Toshihide Ibaraki is a Professor with Kwansei Gakuin University, Japan and Professor Emeritus of Kyoto University, Japan. He is a Fellow of the ACM and Operations Research Society of Japan.

Summary

With applications in communication, transportation, and production, graph connectivity has thrived using the theory of complexity and algorithms in modern computer science. This is the first thorough book on this central notion in graph and network theory, and covers new concepts and algorithms for quicker and more efficient computing.

Product details

• Authors: Toshihide Ibaraki, Toshihide (Kwansei Gakuin University Ibaraki, Ibaraki Toshihide, Hiroshi Nagamochi, Hiroshi (Kyoto University Nagamochi, Nagamochi Hiroshi
• Publisher: Cambridge University Press ELT
• Languages: English
• Product format: Paperback / Softback
• Released: 31.05.2019
• EAN: 9781108735490
• ISBN: 978-1-108-73549-0
• No. of pages: 391
• Series: Encyclopedia of Mathematics and its Applications
• Subjects: Natural sciences, medicine, IT, technology > Mathematics > Arithmetic, algebra; COMPUTERS / Programming / Algorithms, Algorithms & data structures, Combinatorics & graph theory, Combinatorics and graph theory