Algorithmic aspects of graph connectivity
By: Hiroshi Nagamochi and Toshihide Ibaraki.
Contributors: Ibaraki, Toshihide.
Publisher: Cambridge University Press
Published: 2008
Place of publication: New York
Language: eng
Number of pages: 375
ISBN-13: 9780521878647
Subjects: Graph connectivity; Graph algorithms
Description: "Algorithmic Aspects of Graph Connectivity is the first book that thoroughly discusses graph connectivity, a central notion in graph and network theory, emphasizing its algorithmic aspects. This book contains various definitions of connectivity, including edge-connectivity, vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts." "Covering both basic definitions and advanced topics, this book can be used as a textbook in graduate courses of mathematical sciences (such as discrete mathematics, combinatorics, and operations research) in addition to being an important reference book for all specialists working in discrete mathematics and its applications."--Jacket.
Notes: Includes index.