Авторизация
Поиск по указателям
Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1)
Обсудите книгу на научном форуме Нашли опечатку?
Название: 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.
Язык: Рубрика: Математика /Алгебра /Комбинаторика /Статус предметного указателя: Готов указатель с номерами страниц ed2k: ed2k stats Год издания: 1995Количество страниц: 1120Добавлена в каталог: 10.03.2005Операции: Положить на полку |
Скопировать ссылку для форума | Скопировать ID
Предметный указатель
Covering radius 776 799 939 Coverings of crystal lattices 1976 Coxeter complex 677 Coxeter diagram 677 Coxeter graph 52 54 64 1452 1472 Coxeter group 677 2061 Coxeter theorem 677 Coxeter, H.S.M. 666 677 812 819 838 897 940 947 958 1459 1488 1494 1751 1778 Coxeter, H.S.M.A. 2140; see “Conway J.H.” Cramer, J.S. 1891 1893 Crane, R.P. 1275; see “Clark L.H.” Crapo, H.H. 498 514 522 1913 Cremona diagrams 1921 Cremona, L. 1921 Crepeau, C. 2035; see “Bmssard G.” Critical ear decomposition 196 208 Critical element 236 Critical graph 156 196 2179 Critical graph conjecture 275 Critical lattice 931 933 934 936 Critical path 2187 Critical probability 1933 1934 1936 Critical problem of combinatorial geometry 514 Critically imperfect graph 268 269 Croft, H.T. 811 839 Croft, H.T.A. 845; see “Conway J.H.” Cross product conjecture 454 Cross-intersecting families 1296 Cross-polytope 897 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 546 560 569 577 578 588 590 1659 1678 1679 Cunningham, W.H.A. 213 214; J.” Cunningham, W.H.B. 569 587 594; R.E.” Current graph 325 Current sources 1913 Curtis, C.W. 625 630 1864 Curtis, R.T. 2143 2145 Curtis, R.T.A. 622; see “Conway J.H.” Cut 34 403 Cut edge 10 118 Cut node 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 40 Cycle structure 633 Cycles of permutations 1125 Cyclic d-polytope 893 901 Cyclic difference sets 2181 2183 Cyclic permutation 1030 1050 Cyclic polylopes 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-paving 499 d-polytopal digraph 906 d-polytopal graph 879 905—907 d-regular graph 7 d-step conjecture 906 908 Dagum, P. 1352; see “Chung F.R.K.” Dahmen, W. 958 Dalmazzo, M. 159 Damerell, R.M. 713 761 Danaraj, G. 883 887 906 1854 1855 1857 Dancis, J. 907 Daniels, D. 1997 Danilov, V.I. 958 Dantzig, G.B.A. 908; see “Adler 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, EN. 1213 2167 2174 Davidson, R.A. 1960 1965 1966 Davies, B. 1192 1212 Davies, R.O. 710 Davis, M. 1606 Davis, R. 1993; see “Betstein D.” Dawson, T.R. 2137 Dawson’s Chess 2137 2159 Dawson’s Kayles 2136 2137 Daykin, D.E.A. 713 Daykin, D.E.B. 1317; see “Bollobas B.” Daykin, D.E.C. 1303 1312; A.” Daykin. D. 446; see “Ahlswede R.” de Bruijn — Erdos inequality 697 de Bruijn — Erdos theorem 237 651 de Bruijn, N.G. 237 651 697 812 829 842 945 958 108] 1085 1087 1090 1092 1094 1140 1141 1172 1177 1183 1186 1187 1212 2089 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 Witte, F. 713 Dean, N. 75 86 87 Dean, N.A. 315; see “Bienstock D.” Debranner, H.A. 811 848 855 856 859; H.” Debrunner, H. 855 856 Decidabie 1604 1619 Decidability of asymptotic problems 1212 Decidable language 1619 Decision problem 14 1336 1602 1604 1605 1621 Decision tree 2005 Decomposition (edge partition) 81 Decomposition theorem for polyhedra 1655 DECREASEKEY operation 2039—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 717 718 749 750 752—754 758—760 762—765 783 798 799 1471 1715 1716 1718 1719 Delsarte, Ph.A. 716; see “Goethals J.-M.” Delta-matroid 579 Delta-matroid intersection 581 Demange, G. 1901; see “Belinski M.L.” Demarrais, J. 1520; see “Adleman L.M.” Dembowski, IR 650 653 655 659 669 697 699 704 1710 Dembowski-Wagner theorem 653 Deming, R.W. 220 DENDRAL 1969 1970 Denef, J. 10 Denes, J.A. 705 Denjoy, A. 1439 Denniston, R.H.E 662 673 702—704 712 730 2184 Density of edges 1246 Density statement/theorem 418 1339 1383 Dentzig, G.B. 1656 1657 1659 1669 1696 1902 2188 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 2167 Derigs, U. 183 193 Derigs, U.A. 184; see “Burkard R.” Derivation 670 Derived design 700 Desargues configuration 816 Desarguesian geometries 2181 Desarguesian projective planes 2181 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 Deuber, W.A. 1360; see “Bergelson V.” Devaney, R.L. 1140 1200 Devroye, L. 1204 1210 Deza, M. 697 1306—1308 1568 2048 2049 Deza, M.A. 2050; see “Avis D.” Deza, M.B. 631 635; E.J.” Deza, M.C. 2049 di Paola, J. 662 Diaconis, P. 1483 1497 1740 1742 Diaconis, P.A. 1483; see “Aideus D.” Diagonal of a power series 1110 Diagonal type 618 Diagram 680 Diameter 908 909 1264 1481 1482 1484 I486 Diameter of a graph 10 Diameter of a polyhedron 1656 Dias, J.R. 1961 1973 Dicks, W. 1494 1495 Dickson, L.E. 620 656 Diet 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 and integral equations 1204 Differential equations 1042 1137 Differential operators 2174 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 pancyclic 78 Digraph edge-l-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, E.W. 13 14 84 123 139 2187 Dijkstra’s algorithm 123 2018 2019 2021 2023 Dilworth truncation 510 Dilworth, R.P. 44 137 437 483 2186 DIMENSION 455 877 1859 Dimension of a face 1842 Dimension of a graph 842 Dinits, E.A. 127 149 150 1661 Dinitz’ problem 277 Diophantine approximation 922 954 958 Diophantine expansion 1583 Dirac theorem 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 Dirac’s problem 824 Direct product 1845 Direct sum 491 502 504 Directed circuit 16 Directed circulant 65 Directed cut 403 404 1676 Directed d-factor of a digraph 69 Directed diameter 16
Реклама
|
|
О проекте