Tolerance Graphs

Klappentext 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. Zusammenfassung The first rigorous treatment of tolerance graphs in book form. This book will act as a springboard for researchers! especially graduate students! to pursue new directions of investigation. With many examples and exercises it is also suitable for use as the text for a graduate course in graph theory. Inhaltsverzeichnis 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.

Dettagli sul prodotto

• Autori: M.c. Trenk Golumbic, Martin Golumbic, Martin Charles Golumbic, Martin Charles (University of Haifa Golumbic, Martin Charles Trenk Golumbic, Ann Trenk, Ann N. Trenk
• Editore: Cambridge University Press ELT
• Lingue: Inglese
• Formato: Copertina rigida
• Pubblicazione: 12.02.2004
• EAN: 9780521827584
• ISBN: 978-0-521-82758-4
• Pagine: 278
• Serie: Cambridge Studies in Advanced
• Categoria: Scienze naturali, medicina, informatica, tecnica > Matematica > Altro