You are viewing content intended for a different location. This may affect your ability to shop online.

Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Item added to bagSorry, there was a problem getting your bag informationItem cannot be purchased with the existing contents of your bagItem unavailable online
✕

was added to your bag.

Please try again.

Sorry, this item cannot be purchased in the same transaction as the existing items in your bag.

Please complete the purchase of the items currently in your bag and then add this item in a separate transaction or visit Shopping Help.

Sorry, this product is not currently available to buy online. Please visit Shopping Help.

View bag and checkout
Remove item
✕

Are you sure you want to remove from your bag?

Recommended product

Popular links

Popular links

Algorithmic Aspects of Graph Connectivity

All titles
Algorithmic Aspects of Graph Connectivity

Algorithmic Aspects of Graph Connectivity

Series:
Authors:
Hiroshi Nagamochi, Kyoto University, Japan
Toshihide Ibaraki, Kwansei Gakuin University, Japan
Published:
May 2019
Availability:
Available
Format:
Paperback
ISBN:
9781108735490

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 collegesales@cambridge.org providing details of the course you are teaching.

    Description

    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
    • Covers up-to-date topics and algorithms in the area of graph connectivity
    • Covers new concepts and algorithms for quicker and more efficient computing

    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

    Product details

    • Published: April 2011
    • Format: Adobe eBook Reader
    • ISBN: 9780511839139
    • Length: 0 pages
    • Weight: 0kg
    • Availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.

    Often bought together

    The Design of Approximation Algorithms
    The Design of Approximation Algorithms

    Format: Hardback

    Randomized Algorithms
    Randomized Algorithms

    Format: Hardback

    Often bought together

    Related Journals

    Combinatorics, Probability and Computing
    Combinatorics, Probability and Computing

    Format: Journal

    Published bimonthly, Combinatorics, Probability & Computing is devoted to the three areas of combinatorics, probability theory and theoretical computer science. Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the theory of algorithms (including complexity theory), randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation.

    Mathematical Structures in Computer Science
    Mathematical Structures in Computer Science

    Format: Journal

    Mathematical Structures in Computer Science is a journal of theoretical computer science which focuses on the application of ideas from the structural side of mathematics and mathematical logic to computer science. The journal aims to bridge the gap between theoretical contributions and software design, publishing original papers of a high standard and broad surveys with original perspectives in all areas of computing, provided that ideas or results from logic, algebra, geometry, category theory or other areas of logic and mathematics form a basis for the work. The journal welcomes applications to computing based on the use of specific mathematical structures (e.g. topological and order-theoretic structures) as well as on proof-theoretic notions or results. The journal will also accept contributions in new interdisciplinary fields bridging computer science, quantum physics, mathematics and information theory. In particular, papers on quantum information processing and communication, as well as on the related issues in quantum language design will be considered. The journal is also interested in papers on computational modelling of epigenetics phenomena, protein-protein interaction, stochasticity in molecular cascades. Mathematical approches to System Biology will be welcomed, within the broad frame of post-genomic views of embryogenesis and evolution.

    Related Journals

    Also by this Author

    Contents

    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.
    Courses
    Resources
    Additional Information
    About the authors

    Authors

    Hiroshi Nagamochi , Kyoto University, Japan

    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 , Kwansei Gakuin University, Japan

    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.

    Accessibility

    Browse by related subject

     
    ✕

    Sorry, this item cannot be purchased in the same transaction as the existing items in your cart.

    Please complete the purchase of the items currently in your cart and then add this item in a separate transaction or contact

    Customer Services

    Cambridge University Press