Skip to content
You are not logged in |Login  
     
Limit search to available items
Record:   Prev Next
Resources
More Information
Bestseller
BestsellerE-book
Author Nagamochi, Hiroshi, 1960-

Title Algorithmic aspects of graph connectivity / Hiroshi Nagamochi, Toshihide Ibaraki.

Publication Info. Cambridge ; New York : Cambridge University Press, 2008.

Item Status

Description 1 online resource (xv, 375 pages) : illustrations.
Physical Medium polychrome
Description text file
Series Encyclopedia of mathematics and its applications ; 123
Encyclopedia of mathematics and its applications ; v. 123.
Bibliography Includes bibliographical references (pages 357-369) and index.
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.
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.
Local Note eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - North America
Subject Graph connectivity.
Graph connectivity.
Graph algorithms.
Graph algorithms.
Genre/Form Electronic books.
Electronic book.
Added Author Ibaraki, Toshihide.
Other Form: Print version: Nagamochi, Hiroshi, 1960- Algorithmic aspects of graph connectivity 9780521878647 (DLC) 2008007560 (OCoLC)212015401
ISBN 9781461941569 (electronic book)
1461941563 (electronic book)
9780511721649 (e-book)
0511721641 (e-book)
9780521878647
0521878640