Lieferbar innert 2 Wochen
BeschreibungTolerance 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.
Inhaltsverzeichnis1. 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.
Pressestimmen' ... great value to researchers in the field, and it can also be used as a graduate text in graph theory, since many examples and exercises have been included.' Zentralblatt MATH
Untertitel: 'Cambridge Studies in Advanced'. Sprache: Englisch.
Verlag: CAMBRIDGE UNIV PR
Erscheinungsdatum: Februar 2004
Seitenanzahl: 265 Seiten