Algorithmic Aspects of Graph Connectivity (Encyclopedia of Mathematics and its Applications, Series Number 123) - Softcover

Nagamochi, Hiroshi; Ibaraki, Toshihide

Softcover

ISBN 10: 1108735495 ISBN 13: 9781108735490

Publisher: Cambridge University Press, 2019

Synopsis

Algorithmic Aspects of Graph Connectivity is the first comprehensive book on this central notion in graph and network theory, emphasizing its algorithmic aspects. Because of its wide applications in the fields of communication, transportation, and production, graph connectivity has made tremendous algorithmic progress under the influence of the theory of complexity and algorithms in modern computer science. The book contains various definitions of connectivity, including edge-connectivity and vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts. The authors comprehensively discuss new concepts and algorithms that allow for quicker and more efficient computing, such as maximum adjacency ordering of vertices. Covering both basic definitions and advanced topics, this book can be used as a textbook in graduate courses in mathematical sciences, such as discrete mathematics, combinatorics, and operations research, and as a reference book for specialists in discrete mathematics and its applications.

About this title

About the Authors

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.

Edition details

• Publisher: Cambridge University Press
• Publication date: 2019
• Language: English
• ISBN 10: 1108735495
• ISBN 13: 9781108735490
• Binding: Paperback
• Edition number: 1
• Number of pages: 391