Algorithmic Aspects of Graph Connectivity (Hardcover)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Series:	Encyclopedia of Mathematics and its Applications
Release date:	September 2008
First published:	September 2008
Authors:	Hiroshi Nagamochi • Toshihide Ibaraki
Dimensions:	234 x 160 x 33mm (L x W x T)
Format:	Hardcover
Pages:	392
ISBN-13:	978-0-521-87864-7
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
LSN:	0-521-87864-0
Barcode:	9780521878647

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!