|
|
 |
| Результат поиска |
Поиск книг, содержащих: Independent set
| Книга | Страницы для поиска | | Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 661, 876 | | Rudin W. — Principles of Mathematical Analysis | 205 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 40, 483, 485, 488, 489, 491, 492, 494, 500—503, 512, 956, 1471, 1757 | | Ito K. — Encyclopedic Dictionary of Mathematics. Vol. 2 | 66.G 186.I | | Christofides N. (ed.), Mingozzi A. (ed.), Toth P. (ed.) — Combinatorial Optimization | 213 | | Bilaniuk S. — A Problem Course in Mathematical Logic (vol. 1) | 52 | | Meyer C.D. — Matrix analysis and applied linear algebra | 181 | | van Lint J.H. — Combinatorial theory seminar | 44 | | Becker T., Weispfenning V. — Groebner bases and commutative algebra | 270 | | Rudin W. — Real and Complex Analysis | 81 | | Haynes T.W., Hedetniemi S.T., Slater P.J. — Fundamentals of domination in graphs | 69 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 40, 483, 485, 488, 489, 491, 492, 494, 500—503, 512, 956, 1471, 1757 | | Godsil C., Royle G. — Algebraic Graph Theory | 343 | | Bapat R.B., Raghavan T.E., Rota G.C. (Ed) — Nonnegative Matrices and Applications | 197 | | Niedermeier R. — Invitation to Fixed Parameter Algorithms | 24, 89, 206, 210, 213 | | Bondy J.A., Murty U.S.R. — Graph theory with applications | 101 | | Comtet L. — Advanced Combinatorics. The Art of Finite and Infinate Expansions | 62 | | Golumbic M.C., Trenk A. — Tolerance Graphs | 4 | | Garey M.R., Johnson D.S. — Computers and intractability. A guide to the theory of NP-completeness | 53—54, 133—134, 139, 146—147, 149, 181, 194. | | Sipser M. — Introduction to the theory of computation | 27 | | Papadimitriou C.H. — Computational Complexity | 188, 208, 210, 213, 307 | | Ross Sh.M. — Topics in Finite and Discrete Mathematics | 137 | | Marchette D.J. — Random Graphs for Statistical Pattern Recognition | 3, 146 | | Ito K. — Encyclopedic Dictionary of Mathematics | 66.G, 186.I | | Du D. (ed.), Pardalos P. (ed.) — Handbook of combinatorial optimization: supplement volume A | 3 | | Rudin W. — Real and complex analysis | 82 | | Kushilevitz E., Nisan N. — Communication Complexity | 6, 124, 169 | | Molloy M.S., Reed B. — Graph Colouring and the Probabilistic Method | 3 | | Klerk de E. — Aspects of Semidefinite Programming | 7 | | Rourke C.P., Sanderson B.J. — Introduction to Piecewise-Linear Topology | 11 | | Ruskey F. — Combinatorial generation | 28 | | Chung F.R.K. — Spectral Graph Theory | 77 | | Papadimitriou C.H., Steiglitz K. — Combinatorial Optimization: Algorithms and Complexity | 361, 363, 403, 430 | | Tucker А. — Applied Combinatorics | 77, 425 | | Bollobás B. — Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability | 136 | | Mitzenmacher M., Upfal E. — Probability and Computing: Randomized Algorithms and Probabilistic Analysis | 133—134 | | Dong F.M., Teo K.L., Koh K.M. — Chromatic Polynomials And Chromaticity Of Graphs | XVI | | Berger M., Cole M. (translator) — Geometry I (Universitext) | 2.4.8 | | Hammer P.L., Rudeanu S. — Boolean methods in operations research and related areas | 209 | | Aigner M. — Combinatorial Theory | 261 | | D'Angelo J.P., West D.B. — Mathematical Thinking: Problem-Solving and Proofs | 215, 6, 219, 22 | | Marcja A., Toffalori C. — A Guide to Classical and Modern Model Theory | 177 | | Cook W.J., Cunningham W.H., Pulleyblank W.R. — Combinatorial optimization | 61, 274 | | Kreher D.L., Stinson D.R. — Combinatorial Algorithms: Generation, Enumeration and Search | 14 | | Ding-Zhu D., Ker-I K. — Problem solving in automata, languages, and complexity | 331 | | Carl D. Meyer — Matrix Analysis and Applied Linear Algebra Book and Solutions Manual | 181 | | Jerrum M. — Counting, sampling and integrating: algorithms and complexity | 94 | | Lewis H.R., Papadimitriou C.H. — Elements of the Theory of Computation | 283, 286, 292, 296, 298, 301—302, 318, 326—328, 332—336 | | Tucker A. — Applied Combinatorics | 77, 425 | | Bapat R.B., Raghavan T.E.S. — Nonnegative Matrices and Applications | 197 | | Liu B., Lai H.-J. — Matrices in Combinatorics and Graph Theory (Network Theory and Applications Volume 3) | 280 | | Liu C.L. — Introduction to combinatorial mathematics | 238, 257 | | Berge C. — Hypergraphs. Volume 45 | Appendix, §1 | | Gibbons A. — Algorithmic graph theory | 189 | | Gibbons A. — Algorithmic graph theory | 189 | | Kechris A.S., Louveau A. — Descriptive Set Theory and the Structure of Sets of Uniqueness | 331 | | Du D.-Z., Ko K.-I. — Theory of computational complexity | 53 | | Bahturin Y.A., Mikhalev A.A., Petrogradsky V.M. — Infinite dimensional lie superalgebras | 56, 70 | | Gossett E. — Discrete Math with Proof | 599 | | Foulds L.R. — Combinatorial optimization for undergraduates | 214 | | Peleg D. — Distributed Computing: A Locality-Sensitive Approach (Monographs on Discrete Mathematics and Applications) | 91 | | Godsil C. — Algebraic Combinatorics (Chapman Hall Crc Mathematics Series) | 353 | | Scheinerman E.A. — Mathematics: A Discrete Introduction | 402, 547 | | Sipser M. — Introduction to the Theory of Computation | 27 | | D'Angelo J.P., West D.B. — Mathematical thinking: problem-solving and proofs | 215—216, 219—222 | | Knuth D.E. — Selected papers on discrete mathematics | 409—410, 420 |
|
|
|
|
О проекте