|
|
 |
| Результат поиска |
Поиск книг, содержащих: Minimum cut
| Книга | Страницы для поиска | | Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 545 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 493 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 493 | | Bondy J.A., Murty U.S.R. — Graph theory with applications | 195 | | Garey M.R., Johnson D.S. — Computers and intractability. A guide to the theory of NP-completeness | 210. | | Sedgewick R. — Algorithms | 438 | | Murota K. — Discrete convex analysis | 316 | | Cook W.J., Cunningham W.H., Pulleyblank W.R. — Combinatorial optimization | 41, 45, 72 | | van Lint J.H., Wilson R.M. — Course in Combinatorics | 52ff | | Hartmann A.K., Rieger H. — Optimization Algorithms in Physics | 99, 101, 115 | | Grimaldi R.P., Rothman D.J. — Discrete and Combinatorial Mathematics: An Applied Introduction | 648, 649, 652—654, 656 | | Grimaldi R.P. — Student Solutions Manual for Discrete and Combinatorial Mathematics | 648, 649, 652—654, 656 | | Chvatal V. — Linear programming | see "Max-flow Min-cut Theorem" |
|
|
|
|
О проекте