| Êíèãà | Ñòðàíèöû äëÿ ïîèñêà |
| Êîðìåí Ò., Ëåéçåðñîí ×., Ðèâåñò Ð. — Àëãîðèòìû: ïîñòðîåíèå è àíàëèç | 1213 |
| Êîðìåí Ò., Ëåéçåðñîí ×., Ðèâåñò Ð. — Àëãîðèòìû: ïîñòðîåíèå è àíàëèç | 88 |
| Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 15 |
| Ito K. — Encyclopedic Dictionary of Mathematics. Vol. 2 | 186.B |
| Grimaldi R.P. — Discrete and combinatorial mathematics. An introduction | 333, 349, 357, 363—368, 372, 373, 394, 395, 530, 533, 657 |
| Diestel R. — Graph Theory | 25, 108, 119 |
| Saad Y. — Iterative Methods for Sparse Linear Systems | 71 |
| Cameron P.J. — Combinatorics : Topics, Techniques, Algorithms | 160 |
| Miller E., Sturmfels B. — Combinatorial Commutative Algebra | 197, 353 |
| Meyer C.D. — Matrix analysis and applied linear algebra | 202 |
| Haynes T.W., Hedetniemi S.T., Slater P.J. — Fundamentals of domination in graphs | 211 |
| Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 15 |
| Clote P., Backofen R. — Computational Molecular Biology | 144 |
| Bach E., Shallit J. — Algorithmic Number Theory (òîì 1) | 57 |
| Brin M., Stuck G. — Introdution to dynamical system | 8, 56, 67 |
| Rotman J.J. — An Introduction to the Theory of Groups | 356 |
| Lorentzen L., Waadeland — Continued fractions and applications | 495 |
| Mahmoud H.M. — Evolution of random search trees | 2 |
| Diestel R. — Graph theory | 28, 49—50, 124, 135, 246, 376 |
| Merris R. — Combinatorics | 395 |
| Grotschel M., Lovasz L., Schrijver A. — Geometric Algorithms and Combinatorial Optimization | 18 |
| Godsil C., Royle G. — Algebraic Graph Theory | 2 |
| Engel K. — Sperner theory | 5 |
| Velleman D.J. — How to Prove It: A Structured Approach | 183 |
| Bapat R.B., Raghavan T.E., Rota G.C. (Ed) — Nonnegative Matrices and Applications | 4, 56, 220, 223 |
| Brouwer A.E., Cohen A.M., Neumaier A. — Distance-Regular Graphs | 433 |
| McEneaney W.M. — Max-Plus Methods for Nonlinear Control and Estimation | 81 |
| Bondy J.A., Murty U.S.R. — Graph theory with applications | 171 |
| Wicker S.B., Kim S. — Fundamentals of Codes, Graphs, and Iterative Decoding | 80, 95 |
| Golumbic M.C., Trenk A. — Tolerance Graphs | 219 |
| Williamson S. — Combinatorics for computer science | 200, 224, 259 |
| Sipser M. — Introduction to the theory of computation | 12 |
| Sandor J., Mitrinovic D.S., Crstici B. — Handbook of Number Theory II | 183 |
| Hein J.L. — Discrete Mathematics | 44 |
| Knuth D.E. — The art of computer programming (vol. 2 Seminumerical Algorithms) | 480—481, 484—485 |
| Ross Sh.M. — Topics in Finite and Discrete Mathematics | 150 |
| Ito K. — Encyclopedic Dictionary of Mathematics | 186. B |
| Du D. (ed.), Pardalos P. (ed.) — Handbook of combinatorial optimization: supplement volume A | 311 |
| Irvine K.R. — Assembly Language for Intel-Based Computers | 211 |
| Barton J.J., Nackman L.R. — Scientific and engineering C++ | 239 |
| Kolman B., Busby R.C., Cutler S.C. — Discrete Mathematical Structures | see “Digraph” |
| Lawvere F.W., Schanuel S.H. — Conceptual Mathematics: A First Introduction to Categories | see Graph |
| Duffie D. — Security Markets. Stochastic Models | 104 |
| von zur Gathen J., Gerhard J. — Modern computer algebra | 398, 442, 643 |
| Watt D.A. — Java collections: an introduction to abstract data types, data structures, and algorithms | see “Digraph”, “Graph” |
| Alagić S., Arbib M.A. — The Design of Well-Structured and Correct Programs | 202 |
| Luger G.F., Stubblefield W.A. — Artificial Intelligence: Structures and Strategies for Complex Problem Solving | 85 |
| Knuth D.E. — The art of computer programming (Vol. 1. Fundamental algorithms) | 371—381, 420 |
| Knuth D.E. — The art of computer programming (Vol. 2. Seminumerical algorithms) | 460—462, 466 |
| Brookshear J.G. — Computer Science: An Overview | 154, 464 |
| Strang G. — Linear Algebra and Its Applications | 102 |
| Hein J.L. — Discrete Structures, Logic, and Computability | 43 |
| Beckenbach E.F. (editor), Polya G., Lehmer D.H. and others — Applied combinatorial mathematics | 186 |
| Papadimitriou C.H., Steiglitz K. — Combinatorial Optimization: Algorithms and Complexity | see “Digraph” |
| Saad Y. — Iterative methods for sparse linear systems | 75 |
| Nishizeki T., Chiba N. — Planar Graphs: Theory and Algorithms (North-Holland Mathematics Studies) | 3, 209 |
| Aho A.V., Ullman J.D. — The Theory of Parsing, Translation, and Compiling, Volume 1: Parsing | see “Graph” |
| Csiszar I., Körner J. — Information Theory: Coding Theorems for Discrete Memoryless Systems | 245 |
| Murota K. — Discrete convex analysis | 52, 88 |
| Bóna M. — A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory | 190 |
| Olver P.J., Shakiban C. — Applied linear. algebra | 123 |
| Cook W.J., Cunningham W.H., Pulleyblank W.R. — Combinatorial optimization | 19 |
| Hein J.L. — Theory of Computation: An Introduction | 19 |
| Graver J.E. — Counting on Frameworks: Mathematics to Aid the Design of Rigid Structures | 159 |
| Kreher D.L., Stinson D.R. — Combinatorial Algorithms: Generation, Enumeration and Search | 62, 88 |
| Jategaonkar A.V. — Localization in Noetherian Rings | (see Link graph) |
| Ore O., Wilson R.J. — Graphs and Their Uses | 63, 149 |
| Neumann M., Berman A., Stern R.J. — Nonnegative matrices in dynamic systems | 19 |
| Wilkinson L., Wills G., Rope D. — The Grammar aof Graphics | 377 |
| Berman A. — Nonnegative Matrices in the Mathematical Sciences | 29 |
| Ding-Zhu D., Ker-I K. — Problem solving in automata, languages, and complexity | 16, see also "Graph" |
| Shafer G. — The Art of Causal Conjecture | 386—391 |
| Carl D. Meyer — Matrix Analysis and Applied Linear Algebra Book and Solutions Manual | 202 |
| Harary F. — Graph Theory | 10 |
| Minc H. — Nonnegative Matrices | 76 |
| Lewis H.R., Papadimitriou C.H. — Elements of the Theory of Computation | 14 |
| Marmanis H., Babenko D. — Algorithms of the intelligent web | 34 |
| Seymour L. — Schaum's Outline of Theory and Problems of Discrete Math | 233—235 |
| Rall L.B. — Automatic Differentiation: Techniques and Applications | 6 |
| Michel A., Liu D. — Qualitative analysis and synthesis of recurrent neural networks | 108, 109 |
| Bapat R.B., Raghavan T.E.S. — Nonnegative Matrices and Applications | 4, 56, 220, 223 |
| Liu C.L. — Introduction to combinatorial mathematics | 168 |
| van Lint J.H., Wilson R.M. — Course in Combinatorics | 2 |
| Roberts F. S. — Graph theory and its applications to problems of society | see "Digraph" |
| Gibbons A. — Algorithmic graph theory | see "Digraph" |
| Gibbons A. — Algorithmic graph theory | see "Digraph" |
| Hopcroft J.E., Ullman J.D. — Introduction to automata theory, languages, and computation | 2 (see also Transition diagram) |
| Brookshear J. — Computer Science | 154, 464 |
| Iverson K.E. — A Programming Language | 46 |
| Averbach B., Chein O. — Problem solving through recreational mathematics | 190 |
| Beckenbach E.F. (ed.) — Applied Combinatorial Mathematics | 186 |
| Gries D. — A Logical Approach to Discrete Math | 423 |
| Aho A.V., Ullman J.D. — The Theory of Parsing, Translation, and Compiling. Volume II: Compiling | see "Graph, directed" |
| Aldous J.M., Wilson R. — Graphs and Applications: An Introductory Approach | 16 |
| Hinrichsen D., Pritchard A. — Mathematical Systems Theory I: Modelling, State Space Analysis, Stability and Robustness | 50, 164—166 |
| Hsu D.F. — Cyclic Neofields and Combinatorial Designs | 4, 169 |
| Bjorner A. — Oriented Matroids | 1 |
| Lipschutz S., Lipson M.L. — Schaum's outline of theory and problems of discrete mathematics | 233—235 |
| Strang G. — Introduction to Applied Mathematics | 93, 624 |
| Bjorner A., Vergnas M., Sturmfels B. — Oriented Matroids, Second edition (Encyclopedia of Mathematics and its Applications) | 1 |
| Du D.-Z., Ko K.-I. — Theory of computational complexity | see "Digraph" |
| Hazewinkel M. — Handbook of Algebra (÷àñòü 1) | 531 |
| Hartmann A.K., Rieger H. — Optimization Algorithms in Physics | 37, 47, 96, 102 |
| Seress Á. — Permutation Group Algorithms | 11 |
| Grimaldi R.P., Rothman D.J. — Discrete and Combinatorial Mathematics: An Applied Introduction | 337, 344, 347, 349, 350, 351, 353, 357, 377, 378, 488, 514, 587, 631, 632, 644 |
| Di Battista G. — Graph Drawing: Algorithms for the Visualization of Graphs | 4 |
| Berman A., Shaked-Monderer N. — Completely Positive Matrices | 38 |
| Anthony M. — Discrete Mathematics Of Neural Networks | 115 |
| Nahin P.J. — When Least Is Best: How Mathematicians Discovered Many Clever Ways to Make Things as Small (or as Large) as Possible | 290—293 |
| Godsil C. — Algebraic Combinatorics (Chapman Hall Crc Mathematics Series) | 354 |
| Sipser M. — Introduction to the Theory of Computation | 12 |
| Campbell S.L., Meyer C.D. — Generalized Inverses of Linear Transformations (Classics in Applied Mathematics) | 117 |
| Young D.M., Gregory R.T. — A Survey of Numerical Mathematics, Volume 2 | 1002 |
| Gill A. — Applied Algebra for the Computer Sciences | 78, 364, 395 |
| Kolman B., Busby R.C., Ross S. — Discrete Mathematical Structures | see "Digraph" |
| Shen A. — Algorithms and Programming | 88 |
| Jones N.D. — Computability and complexity from a programming perspective | 431 |
| Grimaldi R.P. — Student Solutions Manual for Discrete and Combinatorial Mathematics | 337, 344, 347, 349, 350, 351, 353, 357, 377, 378, 488, 514, 587, 631, 632, 644 |
| Badii R., Politi A. — Complexity: Hierarchical structures and scaling in physics | 76, 92, 167 |
| Berman A., Plemmons R.J. — Nonnegative matrices in the mathematical sciences | 29 |
| Voit E. — Computational Analysis of Biochemical Systems: A Practical Guide for Biochemists and Molecular Biologists | 61, 63 |
| V. Bryant — Independence theory in combinatorics: An introductory account with applications to graphs and transversals (Chapman and Hall mathematics series) | 80 |
|
|
Î ïðîåêòå