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

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

blank
blank
blank
Красота
blank
Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1)
Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1)

Читать книгу
бесплатно

Скачать книгу с нашего сайта нельзя

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



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


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

Авторы: 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 Grotschel, and Laszlo Lovasz, 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.


Язык: en

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

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

ed2k: ed2k stats

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

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
$#\mathscr P$      -complete
$(p,\alpha)$-jumbledness      377
$(r,\lambda)$-design      696
$(v,k,\lambda)$ graph      751
$(\sigma, g)$-cage      1264
$K_p$-inequality      1568 1570
$K_r$-saturated      1268
$L^j$-lattice reduction      703
$NC^2$ algorithm      1803
$P_4$-isomorphic graphs      269
$RNC^2$ algorithm      1803
$t-(v,k,\lambda)$ design      696
$Z_p$-space      1864
$\alpha (G)$      181
$\alpha$-critical graph      263 264
$\chi$-critical graph      48
$\frac 13-\frac 23$ conjecture      448
$\Gamma$-flow      292
$\lambda$ by $\lambda$ half-bipartite graph      2105
$\lambda$-design      698
$\mathcal N$-position      2134 2146
$\mathcal O$-position      2146
$\mathcal P$-posilion      2134 2146
$\mathcal{NEXPTIME}$-complete      1629
$\mathcal{NL}$-complete      1638 1639
$\mathcal{PSPACE}$-completeness      1486 1519 1622 1623 1638
$\mathscr F$-inclusion order      465
$\mathscr P$      2089 2090
$\mathscr {P=NP}$      1807
$\matjcal{NP}$      888 1511
$\matjcal{NP}$-complete      15 220 910 953 1518 1615—1620 1627 1632 1636 1998
$\matjcal{NP}$-completeness      246 263 1614 1620 1629 1634 2188
$\matjcal{NP}$-hard      15 220 1486 2188
$\nu$-critical      416 417
$\nu$-critical family      1295
$\nu$-critical k-graphs      1318
$\nu(G)$      181
$\rho(G)$      181
$\sigma$ (closure)      560
$\tau$-cntical      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-Symmetric      924
0/1-Programming      1696
0—1 Law      364 1125 1212 1337
0—1 sequence      1023 1025
1-Extendable graph      195
1-Factor      2186
1-Mahlo cardinals      2098
1-rounded      586
1-tree      1550 1587
2, 3-trees      1203
2- Flow      277
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-isomorphic      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 “Almost surely”
Aarts, E.H.L.      1906; see “van Laarhoven E.J.M.”
Abbott, H.L.      1464
Abel, R.I.R.      704 705
Abelian theorems      1152
Abelian variety      958
Abramowitz, M.      1090
Abramson, E.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.      389 390
Achromatic number      276
Ackermann function      1339 2025
Ackermann hierarchy      1339
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.E.      1593; see “Sherali H.D.”
Addition of edges      8
Additivity principle      1974
Adele      930
Adelnke, 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, L      908
Admissible functions      1177
Admissible lattices      931—933
Affine dependence      486 882
Affine Gale diagram      882
Affine geometry      654
Affine group $A_n$      942
Affine plane      667 696
Affine rank      579; see “Ar”
Affine relations      897
Affine resolvable design      711
Affine type      618
Afftie building      679
AG      696
Agarwal, K.K.      1970; see “Benstock J.D.”
Aharoni, R.      50 412 414 421
Ahmedev, S.S.      2166
Aho, A.V.      14 1142 1144 1604 2009 2018
Ahrens R.V.      675
Ahrens, J.H.      1668
Ahuja, R.K.      114 125 128
Aidswede, R.      446 1012
Aigner, M.      86 237 1712
AIlemang, D.T.      2150 2159
Aizenberg, J.A.      186
Ajfii, M.      371
Ajtai, M.      408 989 1350 1754 2013
Akiyama, K.      1994; see “Isono K.”
Aksionov, V.A.      260
Albertson, M.O.      262 276
Alcohol      1961 1962
Aldous, D.      1210 1482 1483
Aldyama, J.      1828
Alekseev theorem      1256
Alekseev, E.E.      1256
Alekseiev, E.E.      1457
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 matroid      486 507
Algebraic topology      1053 1968
Algebraic variety      899
Algorithm      888 890 1460 1516 1762 1802
Algorithm $NC^2$      1803
Algorithm $RNC^2$      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 exposes 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 Lenstra’s integer programming      2030
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 pscudopolynomial      154S 1581 1618
Algorithm randomized      1611 1612 1627 1630 1641
Algorithm Robinson — Schensted      2175
Algorithm Schreier — Sims      637
Algorithm separation      1570
Algorithm shifting      588
Algorithm simplex      901
Algorithm strongly polynomial      135 1545 1583 1584 1663
Algorithm submodular flow      575 577
Algorithm symmetric greedy      580
Algorithm weighted bipartite matching      1581
Algorithmic geometry of numbers      952
Alignments of k sequences      1187
Aliquot sequence      1011
Alizasteb, E.      1592
Alkanes      1962 2177
Allowable n-sequences      833
Allowable sequences      826 832 833
Alltop, W.O.      701 703 2184
Almkvisl, G.      1123 1185
Almost disjoint      2104
Almost simple group      618
Almost surely (a.s.)      353
Alnksandrov, P.S.      1844
Alon theorem      1274
Alon — Tarsi theorem      277
Alon, N.      76 128 277 423 466 476 865 894 1210 1212 1262 1274 333 1346 1351 1352 1357 1385 1482 1557 1720 1740 1742 1755 1756 1764—1766 1770—1773 1787 18201829 1864 2016 2044
Alon, N.A.      1828; see “Akiyama J.”
Alphabet      1361
Alspaeh, B.      64 73 78 $7 89 90 92 296 712 1473
Alternating diagram      2078
Alternating group      619 1473 1501
Alternating luring machine      1623 1624 1626
Alternating path      183
Alternating sequence      225
Alternating sums      1087
Alternating tree      190
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
Andeesen, 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
Angle order      465
Angluin, D.      1756
Animal      1938
Annexstein, E.      1485
Anslue, R.P.      400 1722
Anthonisso, J.M.      1883 1898 1901
Anti-blockcr      397 1686
Anti-blocking pair      401 1686
Anti-blocking polyhedra      1686
Antichain      137 387 435 1296 1791 2186
Antimatroid      521
Antipodality space      1826 1864
Anttautomorphism      1453
Apartment      677
Apostol, T.M.      1080 1119
Appel, K.      56 236—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, E.      1990; see “Vingron M.”
Argument complexity      1823 1853
Arithmetic progression      475
Arkin, E.M.      1903
Arming, N.H.      847
Arnborg, S.      340
Arnold, L.R.      1894
Arnonov, B.      865
Arrangement      816
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2017
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте