Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Golumbic M.C., Trenk A. — Tolerance Graphs
Golumbic M.C., Trenk A. — Tolerance Graphs



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Tolerance Graphs

Авторы: Golumbic M.C., Trenk 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


Язык: en

Рубрика: Математика/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 2004

Количество страниц: 265

Добавлена в каталог: 25.06.2008

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Recognition problems, see complexity      10
Regular representation      30 37
Reversal      219 227 231
Ribbon diagram      17
Ribbon graph      18
Right diagonal      92
Right tolerance      85
SBS-indexing property      60 61
Separating examples      200 233
Sign pattern      209
Simple elimination ordering      21 22
Simple vertex      21
Simplicial      7
Split graph      8 165 210
Split interval order      87 148
Split semiorder      87 148
Splitting point      87
Stability number      137
Stable set      4
Star      165 237
Star-cutset      41
Star-Cutset Lemma      41
Strong elimination ordering      22
Strong Perfect Graph Theorem      40
Strong umbrella vertex      203 204
Strongly chordal graph      21 22 195 199
Subtrees of a tree      164
Succ(A) (successor set)      111
Successor set      125
Successors      219
Sum-tolerance      194
Sum-tolerance chain graph      195 197 199 216
Sum-tolerance graph      203
Sun      22
Sun-free      22
Symmetric digraph      228
T(c, r) (neighborhood subtree)      170
Temporal reasoning      25 135
Threshold graph      23 48 67 68 190 195 196
Threshold tolerance graph      187 188
Tolerance chain graph      212 213
Tolerance graph      2 5 29 48 66 68 195
Tolerance orientation      38
Tolerance-free      175
Tolerant points      89
Totally bounded bitolerance digraph      229
Totally bounded bitolerance order      87 147
Trampoline      22
Transitive orientation      9 33 109
Transitively orientable      9 33
Trapezoid graph      18 40 48 60 91 94 136
Trapezoid graph recognition      124
Trapezoid order      91 92 94 147
Trapezoid representation      91
TREE      57
Trees, that are $\phi$-tolerance graphs      207
Trees, that are bounded bitolerance digraphs      237
Trees, that are bounded tolerance graphs      54
Trees, that are interval probe graphs      71
Trees, that are NeST graphs      191
Trees, that are tolerance graphs      53 58
Trees, that are unit max-tolerance graphs      216
Triangulated graph      7
TRO      9
TT (tolerance threshold)      187
Two-pair      21 41
Umbrella vertex      204
Underlying graph      219
Unit bitolerance digraph      229 231 236 242 244
Unit bitolerance order      86 95 104 110 115 147
Unit interval graph      12 45 48 67 68
Unit interval order      147 151
Unit max-tolerance graph      216
Unit NeST      177
Unit NeST graph      177
Unit point-core bitolerance order      150
Unit point-core tolerance order      151
Unit probe graph      66—68
Unit sum-tolerance graph      195 216
Unit tolerance digraph      232 236
Unit tolerance graph      45 47 48 66 68 102
Unit tolerance order      98 100 107 110 115 119 147
Unit totally bounded bitolerance order      150
Unit vs.proper      45 67 103 150 177 215 243
Universal vertex      23 175 196
V(G) (the vertex set of a graph G)      1
Vertex intersection graph      165
VPT graph      166
Warren’s Theorem      209
Weak Perfect Graph Theorem      40
Weakly chordal graph      20 36 38 40 48 66 184 195
Weakly transitive      234
Weakly triangulated graph      20
width      107
z-avoiding      244
|| (incomparable)      13
1 2
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте