Primarily for researchers and graduate students, but also perhaps advanced undergraduate mathematics students, Golumbic (U. of Haifa) and Trenk (Wellesley College, Massachusetts) collect and survey the major results of tolerance graphs since they were introduced in 1982 by Golumbic and Monma to solve scheduling problems when resources are generally needed for exclusive use, but can be shared or relinquished when exclusive use is not possible. Chapter-end exercises are included. Annotation ©2005 Book News, Inc., Portland, OR (booknews.com)
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.
Tolerance graphs for researchers and graduate students. Collects important results and discusses applications.
