|
|
 |
| Результат поиска |
Поиск книг, содержащих: Matching, maximum
| Книга | Страницы для поиска | | Niedermeier R. — Invitation to Fixed Parameter Algorithms | 64, 253 | | Garey M.R., Johnson D.S. — Computers and intractability. A guide to the theory of NP-completeness | 192, 202, 256. | | Motwani R., Raghavan P. — Randomized algorithms | 167, 190, 347, 355, 362, 365 | | Papadimitriou C.H., Steiglitz K. — Combinatorial Optimization: Algorithms and Complexity | 219 | | Nishizeki T., Chiba N. — Planar Graphs: Theory and Algorithms (North-Holland Mathematics Studies) | 20, 213 | | Christofides N. — Graph-Theory: an Algorithmic Approach | 49, 50, 340 | | Harary F. — Graph Theory | 96 | | Habib M., McDiarmid C., Ramirez-Alfonsin J. (eds.) — Probabilistic Methods for Algorithmic Discrete Mathematics | 112 | | Leeuwen J.V. — Handbook of Theoretical Computer Science: Algorithms and Complexity | 580 | | Leeuwen J. (ed.), Meyer A.R., Nivat M. — Algorithms and Complexity, Volume A | 580 |
|
|
|
|
О проекте