1 option
Algorithmic aspects of graph connectivity / Hiroshi Nagamochi, Toshihide Ibaraki.
- Format:
- Book
- Author/Creator:
- Nagamochi, Hiroshi, 1960- author.
- Ibaraki, Toshihide, author.
- Series:
- Encyclopedia of mathematics and its applications ; v. 123.
- Encyclopedia of mathematics and its applications ; volume 123
- Language:
- English
- Subjects (All):
- Graph connectivity.
- Graph algorithms.
- Physical Description:
- 1 online resource (xv, 375 pages) : digital, PDF file(s).
- Place of Publication:
- Cambridge : Cambridge University Press, 2008.
- 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 thoroughly 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.
- Contents:
- Maximum adjacency ordering and forest decompositions
- Minimum cuts
- Cut enumeration
- Cactus representations
- Extreme vertex sets
- Edge splitting
- Connectivity augmentation
- Source location problems
- Submodular and posimodular set functions.
- Notes:
- Title from publisher's bibliographic system (viewed on 05 Oct 2015).
- Includes bibliographical references and index.
- ISBN:
- 1-108-73549-5
- 1-139-88342-9
- 1-107-38408-7
- 1-107-38759-0
- 0-511-83913-8
- 1-107-39892-4
- 0-511-72164-1
- 1-107-39051-6
- 1-107-39531-3
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.