|
Электронная библиотека Попечительского совета механико-математического факультета Московского государственного университета
|
|
|
![blank](/z.gif) |
|
Gibbons A. - Algorithmic graph theory |
|
![blank](/z.gif) |
Предметный указатель |
Adjacency list 17
Adjacency matrix 17
Adjacent 2
Admissible, G-admissible graph 86
Aho, A.V. 32 217 244
Amenities graph 93
Ancestor 7
Appel, K. 204 207 211
Approximation algorithm 178
Articulation point 5
Augmenting path, flow 98
Augmenting path, M- 127 136
Auxiliary graph 76
Back edge 20 23
Balanced digraph 6
Balanced tree 36
Basis for circuit-space 54
Basis for cut-set space 59
BDTS 246
Beineke, L.W. 74 92 93 184 204 211
Bell, A.G. 62 63
Bellmore, M. 184
Berge, C. 62 63 92 93 173 184 210 211
BFS 35
Binary tree 7
Bipartite graph 4
Birkhoff, G.D. 201 211
Block 5 24
Blossom 130
Bondy, J.A. 62 63 92 93 210 211
Booth, K.S. 86 92
Bottleneck edge 98
Bounded degree spanning tree problem 246
Branching 40 42
Branching, maximum 40 42
Branching, minimum 40 42 47
Breadth first index 35
BREADTH FIRST SEARCH 35
Breadth first tree 35
Brooks, R.L. 199 211
Busacker, R.G. 62 63 118 119 210 211
Capacity of a cut 97
Capacity of an edge 96
Cayley, A. 49 62 63
Cederbaum, I. 86 92
CGEC 239
Chang, S.K. 42 62
Cheriton, D. 42 62
Chiba, N. 207 211 214
Chinese postman problem 161
Chinese Postman problem for digraphs 165
Chinese Postman problem for graphs 163
Chord 54
Christofides, N. 184
Chromatic index, edge 195
Chromatic index, vertex 195
Chromatic polynomial 201
Church's thesis 216
Circuit 5 6
Circuit space 54
Circuit, Eulerian 153 156
Circuit, Hamiltonian 153 169 173 229 233
Circuit, simple 5 6
CLIQUE |
| | |