|
|
 |
| Результат поиска |
Поиск книг, содержащих: Edge connectivity
| Книга | Страницы для поиска | | Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 552 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 34, 370 | | Alon N., Spenser J. — The probabilistic method | 5—6, 88, 171 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 34, 370 | | Scheinerman E.R., Ullman D.H. — Fractional graph theory: a rational approach to the theory of graphs | 34 | | Bondy J.A., Murty U.S.R. — Graph theory with applications | 42 | | Jain A.K., Dubes R.C. — Algorithms for clustering data | 86 | | Cook W.J., Cunningham W.H., Pulleyblank W.R. — Combinatorial optimization | 72 | | Nijenhuis A., Wilf H.S. — Combinatorial Algorithms: For Computers and Calculators | 199 | | Theodoridis S., Koutroumbas K. — Pattern recognition | 467 | | Leeuwen J.V. — Handbook of Theoretical Computer Science: Algorithms and Complexity | 554 | | Leeuwen J. (ed.), Meyer A.R., Nivat M. — Algorithms and Complexity, Volume A | 554 | | Aldous J.M., Wilson R. — Graphs and Applications: An Introductory Approach | 218, 219 | | Gossett E. — Discrete Math with Proof | 603 | | Jablan S., Sazdanovic R. — LinKnot: knot theory by computer | 4 | | Nijenhuis A., Wilf H.S. — Combinatorial algorithms for computers and calculators | 199 |
|
|
|
|
О проекте