Авторизация
Поиск по указателям
Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2)
Обсудите книгу на научном форуме Нашли опечатку?
Название: 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.
Язык: Рубрика: Математика /Алгебра /Комбинаторика /Статус предметного указателя: Готов указатель с номерами страниц ed2k: ed2k stats Год издания: 1995Количество страниц: 1281Добавлена в каталог: 19.03.2005Операции: Положить на полку |
Скопировать ссылку для форума | Скопировать ID
Предметный указатель
Minimal polynomial 1496 Minimal Radon partition 849 Minimal strong component 16 Minimal system 1656 Minimally rigid 1920 Minimax theorem for games 2189 Minimax theorems 2186 Minimum capacity odd cut 207 Minimum cost flow 135 1900 Minimum cost matching 1579 Minimum cut 493 Minimum degree 244 Minimum distance 776 Minimum node coloring problem 1634 Minimum spanning tree problem 2187 Minimum vertex degree 370 Minimum-length spanning tree 2187 Minkowski plane 661 Minkowski sum 924 949 Minkowski — Hawka theorem 932 Minkowski's fundamental theorem 929 931 952 Minkowski's inequality 947 Minkowski's linear form theorem 933 Minkowski'S second fundamental theorem 930 Minkowski, H. 927 930 1655 Minkowski-reduced bases 927 928 Minor 8 257 391 403 494 496 505—507 519 529 537 1499 Minor of graph 304 Minor of hypergraph 390 Minoux, M. 1545 1900 see M. Minterm 1804 Minty, G.J. 66 183 226 227 260 263 517 534 909 1694 see V. Miquel theorem 659 Mirchandani, P.B. 1898 Mirsky, L. 501 503 562 Miserc Nim 2150 Misere play 2121 2145 2149 2157 Mitchell. C.J. 730 Mixed volumes 946 949 951 Mixing rate 1741 1742 Miyamoto, T. 26 28 1262 see Y. Miyaoka — Yau inequality 828 Miyaoka, Y. 828 Mnev, N.E. 886 890 Mnukhin, V.B. 1522 Mock turtle theorem 2142 2144 Mock turtles 2142 2144 Mocws, D. 1124 Modular flat 504 Modular forms 922 Modular functions 570 922 Modular lattice 651 Modular malroid 504 Moebius 2142 2144 2159 Moebius function 1052 1054 1712 1847 2011 2171 Moebius inversion 1051 1721 Moebius plane 659 704 Moebius transformation 2143 Moers, M. 1297 Mogul 2142 2144 2159 Mohar, B. 1497 1592 Mohar, B.R. 1738 Moidores 2142 2144 Molecular connectivity index 1976 Molecular framework 1965 1967 Molecular graph 1957 Molecular similarity 1977 Molecular structures 1957 1960 Molecular symmetry 1965 1977 Molecules 1957 1958 1974 MOLS see mutually orthogonal Latin squares Moment curve 893 Moments of distribution functions 1113 Monge, G. 2189 Monma, C. 1573 see M. Monma, C.L. 1565 see R.E. Monochromatic set 1334 Monocycles 1976 Monoid 1451 Monomer-dimer problem 1941 1951 Monotone 354 Monotone circuit 2013 2016 2017 Monotone graph property 1822 Monotone increasing 1267 Monotone map 437 Monotone property 355 1253 Monsky, P 864 Monster group 922 949 Montgomery, D. 1479 Montgomery, H.L. 981 990 Montgomery, P. 1371 see P. Moon, J. 1793 see P. Moon, J.W 32 59 79 90 243 264 1163 1268 1274 1499 see W.G. see P. see A. Moore graph 63 760 1264 Moore, E.H. 2181 2184 Moore, J.I. 468 see Moran, A. 1000 see P.A. Moran, S. 1511 1515 see L. Morel, B.M.E. 1896 Morelli, R. 947 949 Morgan algorithm 1970 Morgenslem, I. 1951 see J.L. Morgenstern, O. 2189 see J. Morrison, J.A. 1206 see F.R.K. Moser, L. 59 811 836 838 1125 1126 1182 see J.W. Moser, W.O.J. 114 677 811 818 1488 1494 see H.S.M. see L.M. Moses, S. 1484 see A. Motwani, R. 1592 see D. Motzkin, T. 697 812 814 816 818 827 846 Motzkin, T.S. 882 907 1655 see G. Moufang polygon 676 Mount, D.M. 1460 1511 see L. Muehlbacher, J. 220 MueIIer, V. 240 1521 1722 Mueler theorem 240 Mueller, W.R., see Knop, J.V. 1961 1962 Mullin, R.C. 703 714 805 see I.F. see A. see E.R. see W.H Mulmuley, K. 224 225 1589 1732 1803 Multicomplex 896 Multicut 166 Multidimensional continued fractions 958 Multiterminal and multicommodity flows 2188 Multivariate generating functions 1186 Multucommodity flows 159 218 548 2041 Mumford, D. 951 958 see G.F. Munkres, J.R. 1842 1846 1856 1858 1859 Murasugi, K. 2078 Murota, K. 1913 1919 1923 Murray, S.H. 1484 see F. Murty, K.G. 215 Murty, U.S.R. 57 see J.A. Mutually orthogonal Latin squares (MOLS) 672 705 2182 Muzychuk, M.E. 1502 see M.H. Mycielski, J. 240 Myers, E.W. 1990 see W. n-arc 778 n-cube 1496 n-paramcter set 1361 1364 Naddef, D. 210 909 1656 Nagamochi, H. 117 Naik, R.N. 392 Nakamura, A. 150 see T. Nakamura, M. 580 581 Narayana numbers 1034 Narayanan, H. 1921 Nash — Wilhams theorem 1258 1261 Nash-Williams, C.St.J.A. 25 27 28 41 65 88 145 148 297 343 501 562 1258 1261 1356 1521 1744 see F. Nathans, D. 1994 Nathanson, M.B. 985 987 see P. Neaderhouser, C.C. 836 Near polygon 685 NEAREST INSERTION heuristic 1549 1550 NEAREST NEIGHBOR heuristic 1549 Nearly perfect code 783 Necklace problem 1965 Negacyclic 784 Negami, S. 539 Negative circuit 133 Negative of a game 2124 Negative type cone 2049 Neighbor 5 Neighborhood complex 253 1825 1827 1851 Neighborliness 902 Neighborly 893 894 Nelson, R. 236 Nemclz, T. 406 714 1320 see G.O.H. Nemhauser, G.L. 183 219 404 1545 1574 1669 1695 1696 1892 1896 see R.C. see W.-L. see Y. Nemirovskii, A.S. 1661 see D.B. Nerve 1849 Nerve theorem 1850 Nesetril, J. 240 276 424 462 1333 1336 1337 1340 1351 1355 1356 1357 1367 1368 1369 1370 1373—1377 1379—1382 1385—1389 1391—1393 see N. see P. see P. see J. see I. see M. Nested family 203 1566 Net 684 685 Network flows 1685 Neubueser, J. 943 see H. Neumaier's geometry 681 Neumaier, A. 629 681 685 702 750 759 762 766 768 1449 1504—1506 1734 see A.E. Neumann, B.H. 640 see G. Neumann, H. 640 see G. Neumann, P.M. 616 627 637 638 639 1483 2171 see P.J. see A. Neumann-Lara, V. 147 256 see L. Neumeier, A. 958 Newman, D.J. 21 Newman, M. 924 1751 1756 Newton series 1099 NEXT-FIT heuristic 1551 Nicholson, P. 2168 2169 Niederreiter, H. 1426 see L. Niemeyer, A.C. 1484 see F. Nilli, A. 1344 Nilpotent groups 1478 NIM 2120 2133 2142 Nim-addition 2133 2138 Nim-multiplication 2144 Nim-sequence 2135 Nim-values 2133 2135 Nimber 2133 Nincak, J. 79 Nisan, N. 1744 2005 see L. see J.D. Nishizeki, T. 275 Noda, R. 697 see H. Node 5 383 386 Node coloring 1635 Node cover 181 387 Node packing 181 Node-cover polytope 1666 Node-cover problem 1617 Non-Archimedean valuations 863 Non-bipartile maximum matching 1610 Non-deterministic communication complexity 2008 Non-deterministic polynomial-time 14 Non-deterministic protocols 2008 Non-deterministic Turing machine 1606—1608 1616 1622 1625 Non-evasive complex 1823 1853 Non-Fano matroid 507 Non-linear iteration 1199 Non-linear recurrences 1139 Non-orientable surfaces 261 Non-Pappus matroid 504 508 Non-representable matroid 504 Non-rigid molecular species 1965 Non-separable 10 584 Non-separable matroid 491 Non-separating 91 Non-separating circuit 58 Non-uniform 1604 1613 Nordhaus, E.A. 1238 Nordstrom — Robinson code 796 Norlund, N.E. 1090 1092 1131 Norm 925 2041 2042 Norm polyhedral 2043 Norm, 2042 Norm, 2042 Norm, Euclidean 2042 Normal distribution 1809 1814 Normal hypergraph 384 395 401 Normal play 2121 2149 Normal rational curve 661 Normal ultrafilter 2102 Normalized internal angle 946 Northcott, D.C. 1720 1732 Norton, S.P. 622 see J.H. Nowhere-zero flow 291 1940 Nowhere-zero H-flow 513 Nowhere-zero k-flow 291 Nowhere-zero n-flow 513 Nowitz, L.A. 1500 1502 Nucleus 659 Null design 1721 NUMBER 2130 Number of permutations 2165 Number of subsets 2165 2166 Number of ways of choosing k objects 2167 Number theory 1751 1758 1774 Numbered complex 1858 Numerical analysis 958 Numerical graph invariants 1974 Nyikos, P.J. 1510 see H.A. O-sequence 896 898 902 Oberhettinger, F. 1192 1212 Oberly, DJ. 66 Obershelp, W. 704 715 Objective function 1543 1579 octahedron 6 Octal games 2136 Oda, T. 958 1841 Odd circuit 14 17 36 Odd girth 2105 Odd set cover 182 Odd-cycle inequality 1568 1570 1571 Odd-cycle property 210 Odlyzko, A. 1145 see P. Odlyzko, A.M. 727 763 765 954 955 1098 1103 1108 1122 1134 1135 1141 1146 1153 1157 1159 1160 1164 1166—1168 1181 1187 1188 1194 1200—1203 1203 1204 1206 1773 1989 see N. see M.R. see F.R.K. see P.C. see P. see A.G. see J.R. see L.J. see A. see J.C. see C.L. see J.E. see R.A. Offord, A.C. 2187 see J.E. Ogasawara, M. 763 Ohlsuki, T. 1921 Ohmori, H. 716 see N. Oilman, L.T. 1273 Okamura, H. 163 164 Olaru, E. 269 Oleinik, O.A. 1761 Oligomorphic 640 Oliver, R. 1823 Olson, I.E. 1410 1768 1770 Olver, F.W.J. 1092 1094 1095 1172 1212 On-line algorithm 441 On-line heuristic 1552 On-line partition 441 On-line problem 1544 Onaga, K. 160 One-sided irregularities 1440 One-way functions 2027—2030 2032 2033 One-way infinite path 2089 Open cell 1860 Open interval 1843 Open walk 9 Oppcnheim, R. 397 see D.R. Opposite regulus 670 Optimal code 780 Optimal partial k-path coloring 50
Реклама
|
|
О проекте