Williamson S. — Combinatorics for computer science :: Электронная библиотека попечительского совета мехмата МГУ

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

Авторизация

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

Williamson S. — Combinatorics for computer science

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

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

Название: Combinatorics for computer science

Автор: Williamson S.

Аннотация:

Useful guide covers two major subdivisions of combinatorics — enumeration and graph theory — with emphasis on conceptual needs of computer science. Each part is divided into a "basic concepts" chapter emphasizing intuitive needs of the subject, followed by four "topics" chapters that explore these ideas in depth. Invaluable practical resource for graduate students, advanced undergraduates, and professionals with an interest in algorithm design and other aspects of computer science and combinatorics.

Язык:

Рубрика: Computer science/Дискретная математика/

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

ed2k: ed2k stats

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

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID

Предметный указатель

Abstract dual      384 386
Action matrix      119 120 123 126
Action of wreath product      145
Acyclic      227
Adjacency table      226
Adjacent comparators      62 63
Adjacent marks      86
Algebra      189
Alternating permutations      259
Ancestor      244
Antiisomorphism      117
antisymmetric      3
Arching relation      339 340
Articulation point      272 337
Associative binary operation      115
Augmentable path      204
Aut(G)      262
Automorphism      262
Backedge      256
Backedges      290 301
Backtracking      19 36
Balls into boxes      93 173
Bases of matroids      360
Basis sequence      177
Basis shift operator      177 181
Batcher odd-even merge      72
Batcher sort      74
Bicomponent tree      276
Biconnected      272 337
BIJ(A, B)      261
Bijection      5 134
Binary insertion      49
Binary matroid      383
Binary operation      115
Binomial coefficients      90
Bipartite graph      207 208 286 303 387
Bipartite graph of a poset      210
Bipartite induced matroid      389 391
Blocking set      207
BLOCKS      4 95
Breadth first order      235
Breadth first order on vertices      51
BREAK(H)      270
Bridge      275
Bridge complete      352
Bridge graph      280
Bridges of a matroid      411
Broken circuits      438
Broken cycle      275
Brokenness      421 425
Bumside’s lemma      121 122 124 127 128 129
Burnside matrix      121
Canonical diagram      264 265
Capacity      200 202 203
Carrier      275
Cartesian action      149 150 152 159
Cartesian product      194
Catalan numbers      171
Cauchy — Binet theorem      391
centralizer      119 121
Chain      209
Chain cover      209
Characteristic      362
Characteristic function      7
chords      246 256
Chromatic number      435
Chromatic polynomial      434 435 436
Circuits of a matroid      376 382
Class consistent      119
Closed carrier      348 349
Closure      382
Closure operator      374
CNL-tree      419
Cobase      381
Cocircuits      382
CODE(T)      264
Cographical matroid      381
Coimage      5
Colex order      14 87 93
Coloop      413
Color printed partitions      173 174 175
Column incidence graph      406 407
Column matroid      360 366
Combinatorial geometries      359 440
Commutative      361
Comparable      209
Comparator sorting strategy      58
Complete binary tree      51
Complete homeomorphic reduction      323
Complete matching      207 208 387
Component partition      199
composition      135 169
Compositional inverse      178
CON(V)      258
Conjugacy classes      119
Conjugate mirror image      421
Conjugate subgroups      119
Connected graphs      199 227 259
Connected matroids      405
Connectivity      338
Consistent embedding      302 306
constant time      10
Contraction of matroids      398 414
Convolution      166 189
Corank      421 425
cosets      119
Covering relation      6
Crystallographic groups      132
Cut      203
Cut partition      203
Cutsets      382
CYCLE      227 278
Cycle equivalent      272
Cycle index polynomial      139 140 142
Cycle matroid      386 409
Cycle notation      134 135
CYCLE(e)      300
Data structure      10 251
de Bruijn’s theorem      153
Degree      226 228
Delay time      59 60
Delete-contract tree      415
Delta function      190
Depth first sequence      232
Derangements      111 172 183 184
Descendant      244
DFE(T)      233 288
DFV(T)      233 288
Diagraph induced matroid      394 396
Differentiation operator      179
Dihedral group      116 141 157
Dilworth’s theorem      209
Direct access model      250
Direct insertion method      28 82 83 241
Direct product      148
Directed graph      200 224 259
Directed path      232
Directed rooted tree      288
Directly linked      303 313
Dirichlet generating functions      181
Disconnecting set      207
Discrete      4
Disjoint cycle notation      135
Domain      133
Domain boundaries      356
Domino covering problem      22 23 130
Duality for matroids      378
EDGE      224
Edge action      261
Edmond’s intersection theorem      444

Eight queens problem      36
Elementary row operations      364
Elongation of matroids      401
Embeddings      224 280
Enumeration sort      48
EPER(V)      261
EQUIVALENCE      4
Equivalence relation      3
ESEQ(T)      228
Euler numbers      259
Euler relations      286
Euler’s ip-function      185 198
Exchange property      360 442
Exchange sort      49
Exponential generating function      172 174
External activity      422 425
Falling factorials      84
Fano matroid      368
Father      244
Fibbonacci sequence      168
Field      361
Finite field      362
Flow      200 202
Forest      246
Formal power series      178
Free matroid      367 389
Free vector space      202
Full transversal matroid      388 392 396
Function of matroids      393
Galois field      362
Gammoid      396
Gaussian elimination      364 441
Generating function      165
Geometric dual      384 385
Graph      223 224
Graphical matroid      381 384
Graphical minor      419
GRAPHS(V)      261
Gray code      243
Greedoid      443
Greedy algorithm      272 441 448
Greedy weight      442
Group      115
Group actions      115
Group character      128 129
Group of cube acting on faces      139
H(X, Y, Z, k)      237
Hamiltonian cycle      354
Hamiltonian graph      354
Hamiltonian structure tree      353
Hashing      8
Hasse diagram      6 188
Heapsort      52 65
Hereditary language      443
Hereditary property      372
Hereditary set system      442
HOMKERNEL(A, B, F)      323
Homomorphism      115
Hypergraph      225
Hyperplane      375 382
Image      4 133
Incidence algebra      189 190
Incidence function      224
Incidence matrix      193
Inclusion-exclusion      182 197
Increasing functions      86 87 88
INCUT      203
Independent sets      381
Independent sets of a matroid      372
Indistinguishable balls into bins      36
Induced matroid      388
Information theoretic lower bound      64
Injective      134
Insertion sort      48 59
Integral partition      109 111 162 170 171
Integrity theorem      205
Internal activity      422 425
Internal edge      303
Internal nodes      230
Internal segments      303
Interval in a poset      188
INTO(v)      202
INV(G)      258
Invariant partition      159
Inverse      361
Inverse function      134
inversion      60
Inversion enumerator      258
Inversion grid      61
Inverting finite sums      195 196
INVPRU      230
Isomorph rejection      23 36 42 114 155 157
Isomorphism of graphs      260
Isomorphism of groups      117
Isomorphism of matroids      366
Isotopically equivalent embeddings      356
Isthmus      285 385
JOIN(H)      270
Joint matrix representation      379
k-separated graph      337
KERNEL(A, B, F)      322
Keys      38
Kuratowski subgraphs      319
Lah numbers      176
Lattice      440
Lattice of flats      440
Leaf      228
Lex order      88
Lexicographic bucket sort      16 295
Lexicographic list of functions      77 79
Lexicographic list of permutations      82
Lexicographic order      14 26 27 38 76
Lineal descendant      244
Lineal spanning tree      246 249 252 290
Lineal subtree      247
Linear extension      202
Linear recurrences      167
Linearly ordered      8
Linked list      9
Linking system      3%
List of segments      303
LMR diagram      156
Local description      237 240
Locally finite      194
Loop      224 385 413
Loop free algorithm      112
Lower representation      196
Mark      131
Matching      207
Matching matroids      387 388 392
Matching theorem      208
Matrix of marks      131
Matrix of marks for hexagon      132
Matrix principle      70
Matrix representation of a matroid      367
Matroid intersection problem      444
Matroid partitioning problem      444 446
Matroids      359
MAXFLOW      204
MAXFLOW-MINCUT theorem      204
Mendelsohn — Dulmage condition      397
Menger’s theorem      207 211 212
Merge insertion      66 67 68
mincut      204
Minimal dependent sets      376
Minimal diagram      60
Minor      419
Mobius function      191 194 195
Mobius inversion      188
Move      240

1 2

О проекте