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

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

blank
blank
blank
Красота
blank
Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2)
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.


Язык: en

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

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

ed2k: ed2k stats

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

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Cross-ratio      656
Crosscut      1850
Crosscut complex      1851
Crosscut conjecture      444
Crosscut theorem      1851
Crossing cuts      149
Crossing number      314
Crossing submodular function      572
Crowder, H.      1696
Crum Brown, A.      1959
Cruse, A.B.      713
Cryptography      2027 2028 2030
Crystallography      921 923 941
Csima, J.      814 1837
cube      6 897 1338
Cube of a graph      53
Cube theorem      1338
Cubic graph      59 1965
Cullman, G.      806
Cunningham, W.H.      74 209 213 214 546 560 569 577 578 587 588 590 594 1659 1678 1679; J. see R.E.
Current graph      325
Current sources      1913
Curtis, C.W.      625 630 1864
Curtis, R.T.      622 2143 2145; J.H.
Cut      34 403
Cut edge      10 118
Cut nude      117
Cut polytope      1568 1950
Cut vertex      10
Cut-criterion      161
Cutset      34
Cutting plane      206 1691
Cutting plane algorithm      1571
Cutting plane generation      1572
Cutting plane method      1691
Cvetkovic, D.M.      1460 1461 1520 1726 1727 1733 1973 1974
CW complex      1860
CYCLE      10 389 390 424 1266 1472
Cycle index      641 1059 2172
Cycle longest      1474
Cycle matroid      19 486 488 491 494
Cycle of a hypergraph      387
Cycle space      8 10 11 36
Cycle structure      633
Cycles of permutations      1125
Cyclic d-polytope      893 901
Cyclic difference sets      2181 2183
Cyclic permutation      1030 1050
Cyclic polytopes      894 899
Cyclically free      1031
Cyclically k-edge-connected      37
Cyclomatic number      390 1959 1960
d-diagram      883
d-dimensional sphere order      467
d-factor      60
D-finite      1109
d-interval graph      312
d-raving      4У9
d-regular graph      7
d-rolytopal digraph      906
d-rolytopal graph      879 905—907
d-step conjecture      906 908
Dagum, P.      1352; see Chung F.R.K.
Dahmen, W      958
Dalmazzo, M.      159
Damerell, R.M.      713
Danaraj, G.      883 887 906 1854 1855 1857
Dancis, J.      907
Daniels, D.      1997
Danilov, V.I.      958
Dantzig, G.B.      908 1656 1657 1659 1669 1696 1902 2188; I.
Danzer, L.      826 839 841 848 858 898
Darboux theorem      1170
Darboux, G.      1170 1171
Data structures      2018
Datta, B.T.      515
Davenport, H.      950 1429
Daverman, R.J.      1857
David, F.N.      1213 2167 2174
Davidson, R.A.      1960 1965 1966
Davies, B.      1192 1212
Davies, R.O.      710
Davis, M.      1606
Davis, R.      1943; see Botslein D.
Dawson's Chess      2137 2159
Dawson's Kayles      2136 2137
Dawson, T.R.      2137
Daykin, D.      446; see Ahlswede R.
Daykin, D.E.      713 1303 1312 1317; B. Brace A.
Dayman, W.K.      1177—1179
de Braijn, N.G.      237 651 697 812 829 842 945 958 1081 1085 1087 1090 1092 1094 1140 1141 1172 1177 1183 1186 1187 1212 2089
De Bruijn — Erdoes inequality      697
De Bruijn — Erdoes theorem      237 651
de Caen, D.      1321 1322 1708
de Clerck, F.      685; see Thas J.A.
de Concini, C.      2059 2060
de Groot, J.      1498
de la Vega, W.F.      333 410 1808
de Leve, G.      1891 1893; J.S.
de Moivre, A.      2167 2169 2170
de Santis, R.      852
de Vries, H.L.      2180
de Werra. D.      236 398
de Wine, P.      713
Dean, N.      75 86 87 315; D.
Debrunner, H.      811 848 855 856 859; H.
Decidability of asymptotic problems      1212
Decidable      1604 1619
Decidable language      1619
Decide logarithm      1520
Decision problem      14 1336 1602 1604 1605 1621
Decision tree      2005
Decomposition (edge partition)      81
Decomposition theorem for polyhedra      1655
DECREASEKEY operation      2019—2023
Decrementing path      197
Decryption function      2029
Decryption key      2030
Deficiency of a matching      194
Deficiency of a net      685
Degeneracy of a graph      251
Degenerate bridge      40
Degree in a hypergraph      387 391 410 422 1295
Degree of a face      55
Degree of a function      2014 2015
Degree of a set of vertices      71
Degree of a vertex      6
Degree sequence      391 392
Degree sum      42
Degrees of freedom      465
Dehn — Sommerville equations      897 901
Dehon, M.      701 704
Dekking, F.M.      1005
Del Fra, A.      683
Delaunay polytopes      2050
Deleted join      1845
DELETEMIN operation      2019—2023
Deleting of elements of a matroid      494 495
Deletion method      1794 1796
Deletion of a simplex      1845
Deletion of edges      7
Delgado, A.      1504
Deligne theorem      2070
Deligne, P.      1438 2070
Delone, B.N.      923 945
Delorme, C.      1592
Delsarte, Ph.      704 716 717 718 749 750 752—754 758—760 762—765 783 798 799 1471 1715 1716 1718 1719; J.-M.
Delta matroid intersection      581
Delta-matroid      579
Demange, G.      1901; see Balinski M.I.
Demarrais, J.      1520; see Adleman L.M.
Dembowski Wagner theorem      653
Dembowski, P.      650 653 655 659 669 697 699 704 1710
Deming, R.W.      220
DENDRAL      1969 1970
Denef, J.      1110
Denes, J.      705
Denjoy, A.      1439
Denniston, R.H.F.      662 673 702—704 712 730 2184
Density of edges      1246
Density statement/theorem      418 1339 1383
Dependency graph      1798
Dependent set      489
Dependent set of a matroid      483 488 495
Depth-first search      117
Depth-first search tree      14
Derandomization      1351 1544
Derangement numbers      1050
Derangement problem      2171
Derangements      1044 1067 1088
Derigs, U.      183 184 193; R.
Derivation      670
Derived design      700
Desargues theorem      652 2181
Desarguesian geometries      2181
Desarguesian projective planes      2181
Desarguos configuration      816
Descartes, B.      240 241 275
Descartes, Blanche      2137
Descent of a permutation      1042 1045
Descent set      1050
Deshouillers, J.-M.      982; see Balasubramian R.
Design      412 650 654 684 695
Design of synthesis programs      1969
Desrochers, M.      1885
Determinant      222 224 923 1838
Determining a polyhedron      1654
Deuber, W.      1338 1359—1361 1366 1369 1374 1375 1379; V.
Devaney, R.L.      1140 1200
Devroye, L.      1204 1210
Deza, M.      631 635 697 1306—1308 1568 2048 2049 2050; D. Cameron P.J.
Deza, M. (M E Tylkin)      2049
di Paola, J.      662
Diaconis, P.      1483 1497 1740 1742; D.
Diagonal of a power series      1110
Diagonal type      618
Diagram      680
Diameter      908 909 1264 1481 1482 1484 1486
Diameter of a graph      10
Diameter of a polyhedron      1656
Dias, J.R.      1961 1973
Dicks, W.      1494 1495
Dickson, L.E.      620 656
Did problem      2189
Dieudonne, J.      620
Difference body      925 938
Difference set      991
Differences between the consecutive primes      980
Different angles      846
Different distance      838
Differentiably finite power series      1109
Differential equations      1042 1137
Differential operators      2174
Differentia] and integral equations      1204
Diffie, W.      2028
Digon      10
Digraph      15
Digraph, acyclic      16
Digraph, associated      15
Digraph, Cayley      64 1467 1496
Digraph, covering      1454
Digraph, d-polytopal      906
Digraph, directed d-factor of      69
Digraph, edge pancyche      78
Digraph, edge-1-cyclic      78
Digraph, excess of      87
Digraph, functional      1024
Digraph, head of      15
Digraph, Koh      18
Digraph, permutation      1047
Digraph, polytopal      906
Digraph, rth residue      1454
Digraph, strict      15
Digraph, strict complete      15
Digraph, strong (strongly connected)      16
Digraph, strong component of      16
Digraph, strongly Hamilton-connected      68
Digraph, tail of      15
Digraph, weakly Hamilton-connected      68
Dijkstra's algorithm      123 2018 2019 2021 2023
Dilkstra, E.W.      13 14 84 123 139 2187
Dilworth theorem      44 437 438 2186
Dilworth truncation      510
Dilworth, R.P.      44 137 437 483 2186
Dime's problem      824
DIMENSION      455 877 1859
Dimension of a face      1842
Dimension of a graph      842
Dinilz' problem      277
Dinits, E.A.      127 149 150 1661
Diophantine approximation      922 954 958
Diophantine expansion      1583
Dirac thenrem      20 242 250 257 261 1257
Dirac, G.A.      9 20 26 35 37 38 158 236—238 242 250 254-257 261 262 266 329 333 515 538 814 824 1235 1257 1262 1280 2176 2179
Direct product      1845
Direct sum      491 502 S04
Directed circuit      16
Directed circulant      65
Directed cut      403 404 1676
Directed d-factor of a digraph      69
Directed diameter      16
Directed girth      16
Directed graph      15
Directed path      16
Directed poset      1854
Directed reachability problem      1608 1642
Directed trail      16
Directed walk      16
Directed-cut covering      1676
Directed-graph reachability problem      1638 1639
Directed-path system      30
Dirichlet series      929 1099
Dirichlet theorem      933
Dirichlet's box principle      2184
Dirichlet, P.G.L.      2184
Disconnected maatroid      491
Discrepancy      1792 1802 2044
Discrepancy of hypergraphs      1408 1414
Discrepancy of hypergraphs, diagonal      1414
Discrepancy of hypergraphs, hereditary      1414
Discrepancy of hypergraphs, inhomogeneous      1414
Discrepancy of matrices      1416
Discrepancy of point sequences      1428
Discrete group      921
Discrete isoperimetric problem      1297
Discrete logarithm problem      1619
Discrete subgroups      942 958
Disjoint paths      143 159 536
Disjointness problem      2007
Disjunctive compound      2124
Disk order      467
Dismantlable poset      1854
Distance      10 114 776
Distance criterion      161
Distance distribution      779
Distance enumerator      779
Distance invariant      779 800
Distance-regular graph      760 1506 1507
Distance-transitive graph      629 766 1452 1455 1505 1506
Distinct representatives      2185
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2019
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте