FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

  • Safe delivery by Christmas SANTA SAFE
    Algorithmic Aspects of Graph Connectivity

Algorithmic Aspects of Graph Connectivity

Hiroshi Nagamochi
    Product form
      FORMAT: Hardback

      R 4,542.83 Price and availability exclusive to website

      YOU COULD EARN 4,542.83 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 10 - 15 Business Days
      BUY NOW PAY LATER
      From R 757.13 per month!
      3x monthly payments of R 1,514.27 with
      4x fortnightly payments of R 1,135.70 with

      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.

      Format: Hardback CONTRIBUTORS: Hiroshi Nagamochi EAN: 9780521878647 COUNTRY: United Kingdom PAGES: 392 WEIGHT: 680 g HEIGHT: 234 mm
      PUBLISHED BY: Cambridge University Press DATE PUBLISHED: 2008-09-08 CITY: GENRE: MATHEMATICS / Combinatorics WIDTH: 160 mm SPINE:

      Book Themes:

      Combinatorics and graph theory

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      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.

      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.

      Format: Hardback CONTRIBUTORS: Hiroshi Nagamochi EAN: 9780521878647 COUNTRY: United Kingdom PAGES: 392 WEIGHT: 680 g HEIGHT: 234 mm
      PUBLISHED BY: Cambridge University Press DATE PUBLISHED: 2008-09-08 CITY: GENRE: MATHEMATICS / Combinatorics WIDTH: 160 mm SPINE:

      Book Themes:

      Combinatorics and graph theory

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      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.

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account