Skip to content
Cart

Your Cart

×

You have 0 items in your cart.

Register Sign in Wishlist
Algorithmic Graph Theory

Algorithmic Graph Theory

$71.99 (X)

textbook
  • Date Published: July 1985
  • availability: Available
  • format: Paperback
  • isbn: 9780521288811

$ 71.99 (X)
Paperback

Add to cart Add to wishlist

Request examination copy

Instructors may request a copy of this title for examination

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • This is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with an interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colourability, flows in networks, matchings and traversals) and covers many of the major classical theorems, the emphasis is on algorithms and thier complexity: which graph problems have known efficient solutions and which are intractable. For the intractable problems a number of efficient approximation algorithms are included with known performance bounds. Informal use is made of a PASCAL-like programming language to describe the algorithms. A number of exercises and outlines of solutions are included to extend and motivate the material of the text.

    Reviews & endorsements

    "...judiciously written...a good text..." SIAM Review

    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: July 1985
    • format: Paperback
    • isbn: 9780521288811
    • length: 272 pages
    • dimensions: 231 x 155 x 18 mm
    • weight: 0.42kg
    • availability: Available
  • Table of Contents

    Preface
    1. Introducing graphs and algorithmic complexity
    2. Spanning-trees, branchings and connectivity
    3. Planar graphs
    4. Networks and flows
    5. Matchings
    6. Eulerian and Hamiltonian tours
    7. Colouring graphs
    8. Graph problems and intractability
    Appendix
    Author Index
    Subject Index.

  • Author

    Alan Gibbons, King's College London

Sign In

Please sign in to access your account

Cancel

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 lecturers@cambridge.org

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 www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

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.
×