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

Algorithmic Graph Theory and Perfect Graphs

Martin Charles Golumbic
    Product form
      FORMAT: Hardback

      R 2,318.00 Price and availability exclusive to website

      YOU COULD EARN 2,318 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 20 - 30 Business Days
      BUY NOW PAY LATER
      From R 386.33 per month!
      3x monthly payments of R 772.66 with
      4x fortnightly payments of R 579.50 with
      Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping stone from which the reader may embark on one of many fascinating research trails. The past twenty years have been an amazingly fruitful period of research in algorithmic graph theory and structured families of graphs. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. These have lead to new families of perfect graphs and many algorithmic results. These are surveyed in the new Epilogue chapter in this second edition.
      Format: CONTRIBUTORS: Martin Charles Golumbic EAN: 9780444515308 COUNTRY: United States PAGES: WEIGHT: 660 g HEIGHT: 240 cm
      PUBLISHED BY: Elsevier Science & Technology DATE PUBLISHED: 2004-02-04 CITY: GENRE: MATHEMATICS / Discrete Mathematics WIDTH: 165 cm SPINE:

      Book Themes:

      Combinatorics and graph theory, Mathematical theory of computation

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping stone from which the reader may embark on one of many fascinating research trails. The past twenty years have been an amazingly fruitful period of research in algorithmic graph theory and structured families of graphs. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. These have lead to new families of perfect graphs and many algorithmic results. These are surveyed in the new Epilogue chapter in this second edition.
      Format: CONTRIBUTORS: Martin Charles Golumbic EAN: 9780444515308 COUNTRY: United States PAGES: WEIGHT: 660 g HEIGHT: 240 cm
      PUBLISHED BY: Elsevier Science & Technology DATE PUBLISHED: 2004-02-04 CITY: GENRE: MATHEMATICS / Discrete Mathematics WIDTH: 165 cm SPINE:

      Book Themes:

      Combinatorics and graph theory, Mathematical theory of computation

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account