Algorithmic aspects of graph connectivity /

Saved in:

Bibliographic Details
Author / Creator:	Nagamochi, Hiroshi, 1960-
Imprint:	Cambridge ; New York : Cambridge University Press, 2008.
Description:	1 online resource (xv, 375 pages) : illustrations
Language:	English
Series:	Encyclopedia of mathematics and its applications ; 123 Encyclopedia of mathematics and its applications ; v. 123.
Subject:	Graph connectivity. Graph algorithms. Graph algorithms. Graph connectivity.
Format:	E-Resource Book
URL for this record:	http://pi.lib.uchicago.edu/1001/cat/bib/11831795

Hidden Bibliographic Details
Other authors / contributors:	Ibaraki, Toshihide.
ISBN:	9781461941569 1461941563 9780511721649 0511721641 1139883429 9781139883429 1107384087 9781107384088 1107387590 9781107387591 0511839138 9780511839139 1107398924 9781107398924 1107390516 9781107390515 1107395313 9781107395312 9780521878647 0521878640
Notes:	Includes bibliographical references (pages 357-369) and index. Print version record.
Summary:	"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
Other form:	Print version: Nagamochi, Hiroshi, 1960- Algorithmic aspects of graph connectivity 9780521878647

Similar Items