Tolerance graphs
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 solv...
Đã lưu trong:
Tác giả chính: | |
---|---|
Định dạng: | Sách |
Ngôn ngữ: | Undetermined |
Được phát hành: |
Cambridge, UK
Cambridge University Press
2004
|
Những chủ đề: | |
Các nhãn: |
Thêm thẻ
Không có thẻ, Là người đầu tiên thẻ bản ghi này!
|
Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
---|
LEADER | 01020nam a2200205Ia 4500 | ||
---|---|---|---|
001 | CTU_116873 | ||
008 | 210402s9999 xx 000 0 und d | ||
020 | |c 75.95 | ||
082 | |a 511.5 | ||
082 | |b G629 | ||
100 | |a Golumbic, Martin Charles | ||
245 | 0 | |a Tolerance graphs | |
245 | 0 | |c Martin Charles Golumbic, Ann N. Trenk | |
260 | |a Cambridge, UK | ||
260 | |b Cambridge University Press | ||
260 | |c 2004 | ||
520 | |a 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. | ||
650 | |a Game theory | ||
904 | |i Minh | ||
980 | |a Trung tâm Học liệu Trường Đại học Cần Thơ |