|
|
 |
| Результат поиска |
Поиск книг, содержащих: Perfect matching
| Книга | Страницы для поиска | | Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 556 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 46, 181, 410, 1579, 1588, 1590, 1627, 1628, 2016, 2052, 2186 | | Grimaldi R.P. — Discrete and combinatorial mathematics. An introduction | 692 | | Christofides N. (ed.), Mingozzi A. (ed.), Toth P. (ed.) — Combinatorial Optimization | 155 | | Diestel R. — Graph Theory | see “1-factor” | | Fishman G.S. — Monte Carlo: concepts, algorithms, and applications | 452 | | Haynes T.W., Hedetniemi S.T., Slater P.J. — Fundamentals of domination in graphs | 79 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 46, 181, 410, 1579, 1588, 1590, 1627, 1628, 2016, 2052, 2186 | | Wegener I. — Complexity of Boolean Functions | 193, 426 | | Diestel R. — Graph theory | see J-factor | | Merris R. — Combinatorics | 383, 393 | | Grotschel M., Lovasz L., Schrijver A. — Geometric Algorithms and Combinatorial Optimization | 17, 203, 203—208, 230—233, 255—259 | | Lando S.K., Zvonkin A.K. — Graphs on Surfaces and Their Applications | 365 | | Scheinerman E.R., Ullman D.H. — Fractional graph theory: a rational approach to the theory of graphs | 24 | | Godsil C., Royle G. — Algebraic Graph Theory | 43 | | Hogben L. — Handbook of Linear Algebra | 30—2 | | Bondy J.A., Murty U.S.R. — Graph theory with applications | 70 | | Finch S.R. — Mathematical constants | 407 | | Motwani R., Raghavan P. — Randomized algorithms | 66, 145, 167, 190, 347—355, 365, 366 | | Du D. (ed.), Pardalos P. (ed.) — Handbook of combinatorial optimization: supplement volume A | 77—80 | | Brualdi R.A., Ryser H.J. — Combinatorial Matrix Theory | 247, 251, 258, 318—319, 321—322 | | Murota K. — Discrete convex analysis | 89 | | D'Angelo J.P., West D.B. — Mathematical Thinking: Problem-Solving and Proofs | 218, 9, 231 | | Kozen D.C. — The Design And Analysis Of Algorithms | 101, 141, 142, 144, 213, 224, 235, 255, 286, 299 | | Cook W.J., Cunningham W.H., Pulleyblank W.R. — Combinatorial optimization | 127, 312, 314, 315 | | Bona M. — Combinatorics of permutations | 56 | | Janson S., Rucinski A., Luczak T. — Random Graphs | 82, 105, 244, 261 | | Minc H. — Nonnegative Matrices | 100 | | Villareal R.H. — Monomial algebras | 165 | | van Lint J.H., Wilson R.M. — Course in Combinatorics | 36, 496 | | Everest G., van der Poorten A., Shparlinski I. — Recurrence sequences | 177 | | Yap H.P. — Total Colourings of Graphs | 2 | | Leeuwen J.V. — Handbook of Theoretical Computer Science: Algorithms and Complexity | 108, 133, 134, 580 | | Leeuwen J. (ed.), Meyer A.R., Nivat M. — Algorithms and Complexity, Volume A | 108,133,134,580 | | Wagon S. — The Banach-Tarski Paradox | 114 | | Villarreal R.H. — Monomial Algebras | 165 | | Hartmann A.K., Rieger H. — Optimization Algorithms in Physics | 228 | | Grimaldi R.P., Rothman D.J. — Discrete and Combinatorial Mathematics: An Applied Introduction | 666 | | Yovits M. — Advances in Computers.Volume 26. | 127 | | Grimaldi R.P. — Student Solutions Manual for Discrete and Combinatorial Mathematics | 666 | | D'Angelo J.P., West D.B. — Mathematical thinking: problem-solving and proofs | 218—219, 231 | | Bona M. — Combinatorics of Permutations | 56 |
|
|
|
|
О проекте