|
|
 |
| Результат поиска |
Поиск книг, содержащих: Max-flow min-cut theorem
| Книга | Страницы для поиска | | Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 546 | | Grimaldi R.P. — Discrete and combinatorial mathematics. An introduction | 676, 677, 679, 695 | | Diestel R. — Graph Theory | 125, 127, 144, 145 | | Cameron P.J. — Combinatorics : Topics, Techniques, Algorithms | 174—176, 185, 294 | | Grimmett G. — Percolation | 50, 378 | | Diestel R. — Graph theory | 141, 143, 160, 161 | | Grotschel M., Lovasz L., Schrijver A. — Geometric Algorithms and Combinatorial Optimization | 199, 237 | | Lawler E.L. — Combinatorial Optimization: Networks and Matroids | 113 | | Engel K. — Sperner theory | 119 | | Bondy J.A., Murty U.S.R. — Graph theory with applications | 198 | | Bollobas B. — Modern Graph Theory | 67, 70, 91 | | Papadimitriou C.H. — Computational Complexity | 9, 15, 221, 381 | | Ross Sh.M. — Topics in Finite and Discrete Mathematics | 154 | | Cook W.J., Cunningham W.H., Pulleyblank W.R. — Combinatorial optimization | 41, 48, 52—54, 57, 58, 224 | | Kreyszig E. — Advanced engineering mathematics | 978 | | Diestel R. — Graph Theory | 125, 121, 144, 145 | | Leeuwen J.V. — Handbook of Theoretical Computer Science: Algorithms and Complexity | 590, 592 | | Leeuwen J. (ed.), Meyer A.R., Nivat M. — Algorithms and Complexity, Volume A | 590,592 | | Grimaldi R.P., Rothman D.J. — Discrete and Combinatorial Mathematics: An Applied Introduction | 649, 652 | | Grimaldi R.P. — Student Solutions Manual for Discrete and Combinatorial Mathematics | 649, 652 | | Chvatal V. — Linear programming | 370 |
|
|
|
|
О проекте