Algorithmic Aspects of Graph Connectivity

— —

Hiroshi Nagamochi (Kyoto University, Japan) Toshihide Ibaraki (Kwansei Gakuin University, Japan)

Algorithmic Aspects of Graph Connectivity

Hiroshi Nagamochi (Kyoto University, Japan), Toshihide Ibaraki (Kwansei Gakuin University, Japan)

$168.95

Hardback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Cambridge University Press
22 September 2008

Combinatorics & graph theory

Series: Encyclopedia of Mathematics and its Applications

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.

By: Hiroshi Nagamochi (Kyoto University Japan), Toshihide Ibaraki (Kwansei Gakuin University, Japan)
Imprint: Cambridge University Press
Country of Publication: United Kingdom
Volume: 123
Dimensions: Height: 234mm, Width: 160mm, Spine: 33mm
Weight: 680g
ISBN: 9780521878647
ISBN 10: 0521878640
Series: Encyclopedia of Mathematics and its Applications
Pages: 392
Publication Date: 22 September 2008
Audience: Professional and scholarly , Undergraduate
Format: Hardback
Publisher's Status: Active

1. Introduction; 2. MA ordering and forest decompositions; 3. Minimum cuts; 4. Cut enumeration; 5. Cactus representations; 6. Extreme vertex sets; 7. Edge-splitting; 8. Connectivity augmentation; 9. Source location problems; 10. Submodular and posi-modular set functions.

Hiroshi Nagamochi is a professor at the Graduate School of Informatics, Kyoto University. 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 and professor emeritus of Kyoto University. He is a Fellow of the ACM and Operations Research Society of Japan.

Reviews for Algorithmic Aspects of Graph Connectivity

'… a comprehensive graduate level text and a worthy addition to a professional library.' SciTech Book News 'This fine graduate-level textbook discusses the algorithmic efficiency of graph connectivity problems. What is impressive about this book is the unified framework in which algorithmic efficiency is discussed.' Mathematical Reviews 'This excellent book can be an important source for researchers and a valuable textbook for graduate students.' Zentralblatt MATH '… comprehensive and detailed …' EMS Newsletter