The first really thorough book to discuss this central notion in graph and network theory, emphasizing its algorithmic aspects.
"synopsis" may belong to another edition of this title.
Hiroshi Nagamochi is a professor at the Graduate School of Informatics, Kyoto University, Japan. He is a member of the Operations Research Society of Japan and the Information Processing Society.
Toshihide Ibaraki is a Professor with Kwansei Gakuin University, Japan and Professor Emeritus of Kyoto University, Japan. He is a Fellow of the ACM and Operations Research Society of Japan.
"About this title" may belong to another edition of this title.
Seller: Books From California, Simi Valley, CA, U.S.A.
paperback. Condition: Fine. Seller Inventory # mon0004103815
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condition: new. Paperback. 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. With applications in communication, transportation, and production, graph connectivity has thrived using the theory of complexity and algorithms in modern computer science. This is the first thorough book on this central notion in graph and network theory, and covers new concepts and algorithms for quicker and more efficient computing. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9781108735490
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9781108735490
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9781108735490_new
Quantity: Over 20 available
Seller: Chiron Media, Wallingford, United Kingdom
Paperback. Condition: New. Seller Inventory # 6666-IUK-9781108735490
Quantity: 10 available
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 391 pages. 9.10x6.10x1.00 inches. In Stock. This item is printed on demand. Seller Inventory # __1108735495
Quantity: 1 available
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Seller Inventory # C9781108735490
Quantity: Over 20 available
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 391. Seller Inventory # 26375800275
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 391. Seller Inventory # 370277900
Quantity: 4 available
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 391. Seller Inventory # 18375800281