Algorithmic aspects of graph connectivity Nagamochi, Hiroshi

By:

Nagamochi, Hiroshi

Contributor(s):

Ibaraki, Toshihide

Series: Encyclopedia of Mathematics and its Applications No. 123Publication details: New York Cambridge University Press 2008 Description: xv, 375 pISBN:

9780521878647

Subject(s):

DDC classification:

511.5

Summary: 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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Status	Date due	Barcode	Item holds
Book	Ahmedabad	511.5 N2A5 (Browse shelf(Opens below))	Available		166701

Total holds: 0

Browsing Ahmedabad shelves Close shelf browser (Hides shelf browser)

Previous								Next
Previous	511.5 K7R2 Random graphs, geometry and asymptotic structure	511.5 L2T6 Topics in graph automorphisms and reconstruction	511.5 M2A5 Algorithmic graph theory	511.5 N2A5 Algorithmic aspects of graph connectivity	511.5 P6I6 An introduction to grids, graphs, and networks	511.5 W4I6/85 Introduction to graph theory: hints and solutions manual	511.5 Z6D3 Degeneracy graphs and simplex cycling	Next

Includes bibliographical references (p. 357-369) and index.

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.

There are no comments on this title.

to post a comment.