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

Скачать книгу бесплатно (djvu, 2.25 Mb)

---

Читать «Tolerance Graphs»