Tolerance Graphs
$142.00 (C)
Part of Cambridge Studies in Advanced Mathematics
- Authors:
- Martin Charles Golumbic, University of Haifa, Israel
- Ann N. Trenk, Wellesley College, Massachusetts
- Date Published: March 2004
- availability: Available
- format: Hardback
- isbn: 9780521827584
$
142.00
(C)
Hardback
Other available formats:
eBook
Looking for an examination copy?
This title is not currently available for examination. However, 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.
-
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.
Read more- Topic is active area of research with many exciting applications
- Book collects major results that were previously scattered through literature
- Numerous examples and exercises make this book ideal for a graduate course
Reviews & endorsements
"Many first-rate mathematicians have contributed, making the exposition's quality high overall. Highly recommended." D.V. Feldman, University of New Hampshire, CHOICE
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: March 2004
- format: Hardback
- isbn: 9780521827584
- length: 278 pages
- dimensions: 236 x 158 x 19 mm
- weight: 0.54kg
- contains: 75 b/w illus.
- availability: Available
Table of Contents
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 bitolerance recognition
9. Algorithms on tolerance graphs
10. The hierarchy of bitolerance orders
11. Tolerance models on trees
12. Phi-tolerance models
13. Directed tolerance graphs
14. Open questions and further directions.
Related Books
related journals
also by this author
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» 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 ×Are you sure you want to delete your account?
This cannot be undone.
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.
×