|
|
 |
| Результат поиска |
Поиск книг, содержащих: Hypergraph
| Книга | Страницы для поиска | | Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 1217 | | Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 91 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 18, 241, 381, 385, 846, 1456 | | Christofides N. (ed.), Mingozzi A. (ed.), Toth P. (ed.) — Combinatorial Optimization | 158 | | Diestel R. — Graph Theory | 25 | | Alon N., Spenser J. — The probabilistic method | 6, 37, 57, 65, 68, 110 | | Cvetkovic D., Doob M., Sachs H. — Spectra of graphs. Theory and application | 50, 110, 267 | | Haynes T.W., Hedetniemi S.T., Slater P.J. — Fundamentals of domination in graphs | 281 | | Matousek J. — Lectures on Discrete Geometry (some chapters) | 203 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 18, 241, 381, 385, 846, 1456 | | Palade V., Jain L.C., Bocaniala C.D. — Computational Intelligence in Fault Diagnosis | 337—338, 348, 350 | | Diestel R. — Graph theory | 28 | | Grotschel M., Lovasz L., Schrijver A. — Geometric Algorithms and Combinatorial Optimization | 225 | | Lawler E.L. — Combinatorial Optimization: Networks and Matroids | 361 | | Scheinerman E.R., Ullman D.H. — Fractional graph theory: a rational approach to the theory of graphs | 184 | | Niedermeier R. — Invitation to Fixed Parameter Algorithms | 34, 72, 267 | | Bollobas B. — Modern Graph Theory | 7 | | Williamson S. — Combinatorics for computer science | 225 | | Kushilevitz E., Nisan N. — Communication Complexity | 65 | | Molloy M.S., Reed B. — Graph Colouring and the Probabilistic Method | 28 | | Sugiyama K. — Graph Drawing and Applications for Software and Knowledge Engineers | 156 | | Luger G.F., Stubblefield W.A. — Artificial Intelligence: Structures and Strategies for Complex Problem Solving | 109 | | Maier D. — The theory of relational databases | 309, 447 — 452 | | Ullman J.D. — Principles of database systems | 290, 332—338, 418—419 | | Bóna M. — Introduction to Enumerative Combinatorics | 356 | | Janson S., Rucinski A., Luczak T. — Random Graphs | 199 | | Shafer G. — The Art of Causal Conjecture | 377—378 | | Fraisse R. — Theory of Relations | A.1.4 | | Beth T., Jungnickel D., Lenz H. — Design Theory (vol. 2) | 13 | | Gross J.L., Tucker T.W. — Topological Graph Theory (Wiley Series in Discrete Mathematics and Optimization) | 97 | | Berge C. — Hypergraphs. Volume 45 | ch.1, §1 | | Diestel R. — Graph Theory | 25 | | Kolchin V.F. — Random Mappings | 33 | | Sachkov V.N., Tarakanov V.E. — Combinatorics of Nonnegative Matrices | 6, 92 | | Gabbay D.M., Hogger C.J., Robinson J.A. — Handbook of Logic in Artificial Intelligence and Logic Programming: Volume 5: Logic Programming | 151—152 | | Witten I.H., Moffat A., Bell T.C. — Managing Gigabytes: Compressing and Indexing Documents and Images | 168 | | Seress Á. — Permutation Group Algorithms | 11, 87 | | Malyshev V.A., Minlos R.A. — Gibbs Random Fields: Cluster Expansions (Mathematics and its Applications) | 75 |
|
|
|
|
О проекте