Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) :: Электронная библиотека попечительского совета мехмата МГУ

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

Авторизация

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

Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2)

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

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

Название: Handbook of combinatorics (vol. 2)

Авторы: Graham R.L., Grotschel M., Lovasz L.

Аннотация:

Combinatorics research, the branch of mathematics that deals with the study of discrete, usually finite, structures, covers a wide range of problems not only in mathematics but also in the biological sciences, engineering, and computer science. The Handbook of Combinatorics brings together almost every aspect of this enormous field and is destined to become a classic. Ronald L. Graham, Martin Grötschel, and László Lovász, three of the world's leading combinatorialists, have compiled a selection of articles that cover combinatorics in graph theory, theoretical computer science, optimization, and convexity theory, plus applications in operations research, electrical engineering, statistical mechanics, chemistry, molecular biology, pure mathematics, and computer science.
The 20 articles in Volume 1 deal with structures while the 24 articles in Volume 2 focus on aspects, tools, applications, and horizons.

Язык:

Рубрика: Математика/Алгебра/Комбинаторика/

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

ed2k: ed2k stats

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

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

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

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

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

$#\mathscr{P}$ -complete      1626 1627
$#\mathscr{P}$ -hard      1627
$(p, \alpha)$ -jumbledness      377
$(r, \lambda)$ -design      696
$(v, k, \lambda)$ graph      751
$(\delta, g)$ -Cage      1264
-inequality      1568 1570
-saturated      1268
lattice reduction      703
algorithm      1803
-isomorphic graphs      269
algorithm      1803
$t-(\nu, k, \lambda)$ design      696
$\alpha$ -critical graph      263 264
$\alpha(G)$       181
$\chi$ -critical graph      48
$\frac{1}{3}$ , $\frac{2}{3}$ conjecture      448
$\Gamma$ -flow      292
$\lambda$ by $\lambda$ half-bipartite graph      2105
$\lambda$ -design      698
$\mathbb{Z}_p$ -space      1864
$\mathcal{N}$ -Position      2134 2146
$\mathcal{N}\mathcal{E}\mathcal{X}\mathcal{P}\mathcal{T}\mathcal{I}\mathcal{M}\mathcal{E}$ -complete      1629
$\mathcal{O}$ -Position      2146
$\mathcal{P}$ -position      2134 2146
$\mathcal{P}\mathcal{S}\mathcal{P}\mathcal{A}\mathcal{C}\mathcal{E}$ -completeness      1486 1519 1622 1623 1638
$\mathscr{F}$ -inclusion order      465
$\mathscr{N}\mathscr{L}$ -complete      1638 1639
$\mathscr{N}\mathscr{P}$       888 1511
$\mathscr{N}\mathscr{P}$ -complete      15 220 910 953 1518 1615—1620 1627 1632 1636 1998
$\mathscr{N}\mathscr{P}$ -completeness      246 263 1614 1620 1629 1634
$\mathscr{N}\mathscr{P}$ -hard      15 220 1486 2188
$\mathscr{P}$       2089 2090
$\mathscr{P}$ -complete      1639—1642
$\mathscr{P}=\mathscr{N}\mathscr{P}$       1807
$\nu$ -critical      416 417
$\nu$ -critical family      1295
$\nu$ -critical k-graphs      1318
$\nu(G)$       181
$\pho(G)$       181
$\sigma$ (closure)      560
$\tau$ -critical      416 417 1295
$\tau$ -critical k-graphs      1314 1318
$\tau(G)$       181
$\theta(G)$       189
$\varepsilon$ -expanding      1481
$\varepsilon$ -regular pair      1246
$\varepsilon$ -uniform pair      1246
(0, 1)-matrices      2170
(i, j)-shift      1298
(m, p, c) set      1359
0-1 sequence      1023 1025
0-1-law      364 1125 1212 1337
0-Symmetric      924
0/1-Programming      1696
1-Extendable graph      195
1-Factor      2186
1-Mahlo cardinals      2098
1-rounded      SR6
1-tree      1550 1587
1th shadow      1295
2,3-trees      1203
2-arc-transitive graph      1469
2-bicritical graph      218
2-cell embedding      318
2-Colorable      1789 1791
2-Colorable hypergraph      246
2-Connected graphs      117 493
2-Factor      211
2-flow      277
2-isomarphic      594
2-Matching problem      218
2-OPT heuristic      1553
2-regular graph      1165
2-shift-graph of a graph G      2107
2-Switching      310
2-Transitive group      623 624
3-Colorability problem      1608 1618 1634
3-Colorable graph      246
3-Connected component      307 1458
3-Connected graphs      151
3-Connected planar graphs      891
3-Dimensional matching problem      220 1617
3-Net      685
3-Partition problem      1619
3-Polytope      891
3-Transposition      1477
4-Flow conjecture      515
A-segments      587
a.s.      353 see
Aarts, E.H.L.      1906; see van Laarhoven P.J.M.
Abbott, H.L.      1464
Abel, R.J.R.      704 705
Abelian theorems      1152
Abelian variety      958
Abramowitz, M.      1090
Abramson, F.G.      1377
Absolute bound      753 759
Absolute point      671 1242
Abstract complex      880
Abstract duality      494
Abstract simplicial complex      1842
Access time      1741 1743 1744
Acharya, B.D.      189 390
Achromatic number      276
Ackermaim hierarchy      1339
Ackermann function      1339 2025
Action of a group      614
Acyclic coloring      276
Acyclic complex      1847 1853
Acyclic digraph      16
Acyclic graph      10
Acyclic hypergraph      390
Acyclic polynomial      1973
Acyclic stability number      45
Acyclic subgraph problem      1696
Acyclic transitive tournament      16
AD-inequality      446
Adam, A.      36 78
Adams, C.R.      1137
Adams, J.      1906 1907
Adams, W.P.      1593; see Snerali H.D.
Addition of edges      8
Additivity principle      1974
Adele      930
Adeleke, S.A.      640
Adjacency matrix      6 15 1455 1460 1464 1725 1755—1757
Adjacent faces of a planar graph      55
Adjacent vertices of a graph      5
Adjacent vertices of a polyhedron      1655
Adleman, L.      2030; see Rivest R.L.
Adleman, L.M.      1520
Adler, I.      908
Admissible functions      1177
Admissible lattices      931—933
Affine building      679
Affine dependence      486 882
Affine Gale diagram      882
Affine geometry      654
Affine group $\mathbb{A}_n$       942
Affine plane      667 696
Affine rank      579 see
Affine relations      897
Affine resolvable design      711
Affine type      618
AG      696
Agarwal, K.K.      1970; see Benstock. J.D.
Aharoni, R.      50 412 414 421
Ahlswcde, R.      446 1012
Ahmedev, S.S.      2166

Aho, A.V.      14 1142 1144 1604 2009 2018
Ahrens, J.H.      1668
Ahrens, R.W.      675
Ahuja, R.K.      114 125 128
Aigner, M.      86 237 1712
Aizenbcrg, J.A.      1186
Ajtai, M.      371 408 989 1350 1754 2013
Akiyama, J.      1828
Aksionov, V.A.      260
Aktyama, K.      1994; see Isono K.
Albertson, M.O.      262 276
Alcohol      1961 !
Aldous, D.      1210 1482 1483
Aleksandrov, P.S.      1844
Aleksciev, V.E.      1457
Alekseev theorem      1256
Alekseev, V.E.      1256
Aleksejev, V.O.      709
Aleliunas, B.      1741
Aleliunas, R.      1638
Alexander duality      2069
Alexander, J.M.      923 958; T.L.
Alexander, R.      1437
Alexanderson, G.L.      831
Alexandrov — Fenchel inequalities      448 450 947
Alford, W.R.      1015
Algebra with straightening law      2041 2059
Algebraic decision trees      1762 1763
Algebraic dependence      507
Algebraic geometry      828 1751 1758 1779 2057
Algebraic geometry code      667
Algebraic manifoid      486 507
Algebraic topology      1053 1968
Algebraic variety      899
Algorithm      888 890 1460 1516 1762 1802
Algorithm separation      1570
Algorithm shifting      588
Algorithm simplex      901
Algorithm,       1803
Algorithm,       1803
Algorithm, coloring      244
Algorithm, cutting plane      1571
Algorithm, Dijkstra's      123 2018 2019 2021 2023
Algorithm, dual greedy      556
Algorithm, edge-following      908
Algorithm, exponential-time      13
Algorithm, expose and merge      373
Algorithm, Gosper's      1075 1210
Algorithm, greedy      139 373 638 1545—1547 2187
Algorithm, Kruskal's      1545 1579 2024 2027
Algorithm, Las Vegas      1519 1613
Algorithm, local search      1554
Algorithm, Lovasz's lattice basis reduction      953
Algorithm, matching      191 1589
Algorithm, matroid      556
Algorithm, Morgan      1970
Algorithm, NC      1518
Algorithm, on-line      441
Algorithm, parallel      1458 1518 1642
Algorithm, polynomial      13 245-247 546 953 957 1545 1581 1583 1612 1614 1615 1618 1637
Algorithm, Prim's      1550 2024
Algorithm, probabilistic analysis of      1635
Algorithm, pseudopolynomial      1545 1581 1618
Algorithm, randomized      1611 1612 1627 1630 1641
Algorithm, Robinson Schensled      2175
Algorithm, Sdireier — Sims      637
Algorithm, strongly polynomial      135 1545 1583 1584 1663
Algorithm, submodular flow      575 577
Algorithm, symmetric greedy      580
Algorithm, weighted bipartite matching      1581
Algorithm,, Lenstra's integer programming      2030
Algorithmic geometry of numbers      952
Alignments of k sequences      1187
Aliquot sequence      1011
Alizadeh, К.      1592
Alkanes      1962 2177
Alkinson, M.D.      1518
Allemang, D.T.      2150 2159
Allowable n-sequences      833
Allowable sequences      826 832 833
Alltop, W.O.      701 703 2184
Almkvist, O.      1123 1185
Almost disjoint      2104
Almost simple group      61 8
Almost surely (a.s.)      353
Alneosen, G.      303
Alon theorem      1274
Alon — Tarsi theorem      277
Alon, N.      76 128 277 423 466 476 865 894 1210 1212 1262 1274 1333 1346 1351 1352 1357 1385 1482 1557 1720 1740 1742 1755 1756 1764—1766 1770—1773 1787 1827—1829 1864 2016 2044; J.
Alphabet      1361
Alspach, B.      64 73 78 87 89 90 92 296 712 1473
Alternating diagram      2078
Alternating group      619 1473 1501
Alternating path      183
Alternating sequence      225
Alternating sums      1087
Alternating tree      190
Alternating Turing machine      1623 1624 1626
Altman, E.      839 840
Altshuler, A.      893 894
Amalgamation class      1509
Amalgamation technique      1381 1389
Amar, D.      25 1263
Amicable pair      1011
Amortization of costs      2023
Analytic function      1147
Analytic generating functions      1146
Andersen, L.D.      272 275 713
Anderson, I.      190 435 444
Ando, K.      153
Andreev, A.E.      2016
Andreev, E.M.      313
Andrews, G.E.      970 1039 1068 1120 1123 1185 1194 1213 1942 2174 2175; G.
Angle order      465
Angluin, D.      1756
Animal      1938
Annexstein, F.      1485
Anning, N.H.      847
Anstee, R.P.      400 1722
Anthonisse, J.M.      1883 1898 1901
Anti-Blocker      397 1686
Anti-blocking pair      401 1686
Anti-blocking polyhedra      1686
Antiautomorphism      1453
Antichain      137 1296 1791 2186
Antimatroid      521
Antipodality space      1826 1864
Apartment      677
Apostol, T.M.      1080 1119
Appel, K.      56 216—238 2179
Applegate, D.      1559 1571 1573
Approximate linearization      1141
Approximation method      2013
Ar (affine rank)      579
Aragon, C.R.      1559 1950; D.S.
Arami, Z.      400
Araoz, J.      206 213 214 1685; V.
Arbogast. L.-A.-F.      2170 2173
Arboreal hypergraph      384 395 398
Arborescence      16 115 139 142 143 149 403 1047 1580 1674 1685
Arborescence polytope      1675
Arc of a projective geometry      657 661
Arc-transitive graph      1454 1455 1503—1507
Archdeacon, D.      321 334 342
Arcwise connected      1846
Argos, P.      1990; see Vingron. M.
Argument complexity      1823 1853
Arithmetic progression      475
Arkin, E.M.      1903
Arnborg, S.      340

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

О проекте