Skip to content
Open global navigation

Cambridge University Press

AcademicLocation selectorSearch toggleMain navigation toggle

Your Cart


You have 0 items in your cart.

Register Sign in Wishlist

Algorithmic Aspects of Graph Connectivity

$100.00 ( ) USD

Part of Encyclopedia of Mathematics and its Applications

$100.00 ( ) USD
Adobe eBook Reader

You will be taken to for this purchase
Buy eBook Add to wishlist

Other available formats:

Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • 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.

    • Starts from basic materials of graph theory
    • Up-to-date topics and algorithms in the area of graph connectivity
    • Covers new concepts and algorithms for quicker and more efficient computing
    Read more

    Reviews & endorsements

    "... A comprehensive graduate level text and a worth addition to a professional library."
    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."
    Mukkai S. Krishnamoorthy, Mathematical Reviews

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: April 2011
    • format: Adobe eBook Reader
    • isbn: 9780511839139
    • contains: 1 table
    • availability: Adobe Reader ebooks available from
  • Table of Contents

    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.

  • Authors

    Hiroshi Nagamochi, Kyoto University, Japan
    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, Kwansei Gakuin University, Japan
    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.

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Back to top

Are you sure you want to delete your account?

This cannot be undone.

Cancel Delete

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.