ShopSpell

Tolerance Graphs [Hardcover]

$156.99       (Free Shipping)
98 available
  • Category: Books (Mathematics)
  • Author:  Golumbic, Martin Charles, Trenk, Ann N.
  • Author:  Golumbic, Martin Charles, Trenk, Ann N.
  • ISBN-10:  0521827582
  • ISBN-10:  0521827582
  • ISBN-13:  9780521827584
  • ISBN-13:  9780521827584
  • Publisher:  Cambridge University Press
  • Publisher:  Cambridge University Press
  • Pages:  278
  • Pages:  278
  • Binding:  Hardcover
  • Binding:  Hardcover
  • Pub Date:  01-May-2004
  • Pub Date:  01-May-2004
  • SKU:  0521827582-11-MPOD
  • SKU:  0521827582-11-MPOD
  • Item ID: 100927348
  • Seller: ShopSpell
  • Ships in: 2 business days
  • Transit time: Up to 5 business days
  • Delivery by: Jul 01 to Jul 03
  • Notes: Brand New Book. Order Now.
A rigorous treatment of tolerance graphs for researchers and graduate students which collects important results and discusses applications.Tolerance graphs can be used to quantify the degree to which there is conflict or accord in a system and can provide solutions to questions in the form of 'optimum arrangements'. Arising from the authors' teaching to graduate students in the USA and Israel, this book is intended for use in both mathematics and computer science, where this subject finds important applications in algorithmics. The authors have included numerous exercises with partial solutions which will increase the appeal of the book to instructors as well as graduate students.Tolerance graphs can be used to quantify the degree to which there is conflict or accord in a system and can provide solutions to questions in the form of 'optimum arrangements'. Arising from the authors' teaching to graduate students in the USA and Israel, this book is intended for use in both mathematics and computer science, where this subject finds important applications in algorithmics. The authors have included numerous exercises with partial solutions which will increase the appeal of the book to instructors as well as graduate students.Tolerance graphs can be used to quantify the degree to which there is conflict or accord in a system and can provide solutions to questions in the form of optimum arrangements. Arising from the authors' teaching graduate students in the U.S. and Israel, this book is intended for use in mathematics and computer science, where the subject can be applied to algorithmics. The inclusion of many exercises with partial solutions will increase the appeal of the book to instructors as well as graduate students.1. Introduction; 2. Early work on tolerance graphs; 3. Trees, cotrees and bipartite graphs; 4. Interval probe graphs; 5. Bitolerance graphs and ordered sets; 6. Unit and 50% tolerance graphs; 7. Comparability and invariance results; 8. Bounded bitolerl“\
Add Review