|
|
 |
| Результат поиска |
Поиск книг, содержащих: Vertex cover
| Книга | Страницы для поиска | | Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 1131, 1154 | | Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 866 | | Haynes T.W., Hedetniemi S.T., Slater P.J. — Fundamentals of domination in graphs | 58 | | Diestel R. — Graph theory | 34, 49—51 | | Zimand M. — Computational Complexity: A Quantitative Perspective | 240, 244, 258, 261, 267, 282, 287 | | Eisenbud D. — Computations in Algebraic Geometry with Macaulay 2 | 81 | | Niedermeier R. — Invitation to Fixed Parameter Algorithms | 3, 22, 26, 28, 31, 51, 54, 64, 98, 157, 185, 197, 206 | | Garey M.R., Johnson D.S. — Computers and intractability. A guide to the theory of NP-completeness | 46, 53—56, 72, 79, 85, 133—134, 149, 190. | | Williamson S. — Combinatorics for computer science | 207, 209, 211 | | Knuth D.E. — The art of computer programming (vol. 2 Seminumerical Algorithms) | 485 | | Purdom R.W., Brown C.A. — The analysis of algorithms | 433—434 | | Sedgewick R. — Algorithms | 533 | | Du D. (ed.), Pardalos P. (ed.) — Handbook of combinatorial optimization: supplement volume A | 3, 82 | | Semple Ch., Steel M. — Phylogenetics | 76 | | Knuth D.E. — The art of computer programming (Vol. 2. Seminumerical algorithms) | 466 | | Ruskey F. — Combinatorial generation | 28 | | Ebbinghaus H.-D., Flum J. — Finite Model Theory | 275 | | Kozen D.C. — The Design And Analysis Of Algorithms | 118, 125, 131, 140, 144, 224, 232, 254, 255, 261, 286 | | Bóna M. — A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory | 261 | | Ding-Zhu D., Ker-I K. — Problem solving in automata, languages, and complexity | 329 | | Villareal R.H. — Monomial algebras | 165 | | Liu B., Lai H.-J. — Matrices in Combinatorics and Graph Theory (Network Theory and Applications Volume 3) | 167 | | Sudan M. — Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems | 65 | | Villarreal R.H. — Monomial Algebras | 165 | | Du D.-Z., Ko K.-I. — Theory of computational complexity | 51 | | Hartmann A.K., Rieger H. — Optimization Algorithms in Physics | 51, 273, 274—291 |
|
|
|
|
О проекте