|
|
Результат поиска |
Поиск книг, содержащих: Minimum spanning tree
Книга | Страницы для поиска | Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 329, 393 | Matousek J. — Lectures on Discrete Geometry (some chapters) | 120 (Ex.5) | Goutsias J., Vincent L., Bloomberg D.S. — Mathematical morphology and its applications to image signal processing | 224—226 | Marchette D.J. — Random Graphs for Statistical Pattern Recognition | 50—70, 77 | Pearl J. — Heuristics | 11, 33, 36, 79, 115, 124, 176, 210 | Gallier J. — Geometric Methods and Applications: For Computer Science and Engineering | 284 | Catthoor F., Danckaert K., Kulkarni C. — Data access and storage management for embedded programmable processors | 56 | Sack J.R., Urrutia J. (Ed) — Handbook of Computational Geometry | 270, 427—432, 434—436, 438—440, 443, 444, 450, 451, 453, 455, 672 | Shanbhag D.N. (ed.), Rao C.R. (ed.) — Stochastic Processes - Modelling and Simulation | 58, 67 | Cook W.J., Cunningham W.H., Pulleyblank W.R. — Combinatorial optimization | 9—19, 141, 147 | Kreher D.L., Stinson D.R. — Combinatorial Algorithms: Generation, Enumeration and Search | 149 | Knuth D.E. — The art of computer programming (vol. 1 Fundаmental algorithms) | 371 | Wilkinson L., Wills G., Rope D. — The Grammar aof Graphics | 146, 392 | Sarfraz M. — Advances in geometric modeling | 278 | Lewis H.R., Papadimitriou C.H. — Elements of the Theory of Computation | 350 | Marmanis H., Babenko D. — Algorithms of the intelligent web | see “MST” | Aldous J.M., Wilson R. — Graphs and Applications: An Introductory Approach | 183 | Hartmann A.K., Rieger H. — Optimization Algorithms in Physics | 69 | Salzberg S., Searls D., Kasif S. — Computational methods in molecular biology | 94 | Yovits M. — Advances in Computers.Volume 26. | 113 | Bruss D. (ed.), Leuchs G. (ed.) — Lectures on Quantum Information | 32 |
|
|