|
|
 |
| Результат поиска |
Поиск книг, содержащих: Hamiltonian cycle
| Книга | Страницы для поиска | | Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 845, 870 | | Haynes T.W., Hedetniemi S.T., Slater P.J. — Fundamentals of domination in graphs | 11 | | Merris R. — Combinatorics | 370—371 | | Anderson I. — A first course in discrete mathematics | 69 | | Williamson S. — Combinatorics for computer science | 354 | | Du D. (ed.), Pardalos P. (ed.) — Handbook of combinatorial optimization: supplement volume A | 311 | | Sack J.R., Urrutia J. (Ed) — Handbook of Computational Geometry | 271 | | Adams C.C. — The Knot Book: An Elementary Introduction to the Mathematical Theory of Knots | 222 | | Mitzenmacher M., Upfal E. — Probability and Computing: Randomized Algorithms and Probabilistic Analysis | 113 | | Bóna M. — A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory | 188, 439 | | Kreyszig E. — Advanced engineering mathematics | 960 | | Bona M. — Combinatorics of permutations | 240, 242 | | Ore O., Wilson R.J. — Graphs and Their Uses | 32, 149 | | Ding-Zhu D., Ker-I K. — Problem solving in automata, languages, and complexity | 328 | | Harary F. — Graph Theory | 65 | | Pevzner P.A. — Computational Molecular Biology An Algorithmic Approach | 69 | | Gross J.L., Tucker T.W. — Topological Graph Theory (Wiley Series in Discrete Mathematics and Optimization) | 35 | | Leeuwen J.V. — Handbook of Theoretical Computer Science: Algorithms and Complexity | 86 | | Leeuwen J. (ed.), Meyer A.R., Nivat M. — Algorithms and Complexity, Volume A | 86 | | Tutte W.T. — Graph Theory as I Have Known It | 47 | | Aldous J.M., Wilson R. — Graphs and Applications: An Introductory Approach | 63, 97, 344 | | Foulds L.R. — Combinatorial optimization for undergraduates | 170 | | Scheinerman E.A. — Mathematics: A Discrete Introduction | 421, 547 | | Bona M. — Combinatorics of Permutations | 240, 242 |
|
|
|
|
О проекте