Ãëàâíàÿ    Ex Libris    Êíèãè    Æóðíàëû    Ñòàòüè    Ñåðèè    Êàòàëîã    Wanted    Çàãðóçêà    ÕóäËèò    Ñïðàâêà    Ïîèñê ïî èíäåêñàì    Ïîèñê    Ôîðóì   
Ìåõìàòÿíàì
square Ïåðâûé êóðñ

square Âòîðîé êóðñ

square Òðåòèé êóðñ

square ×åòâåðòûé êóðñ

square Ïÿòûé êóðñ
blank
Àâòîðèçàöèÿ

       
blank
Ïîèñê ïî óêàçàòåëÿì

blank
Êðàñîòà
blank
blank
Ðåçóëüòàò ïîèñêà

Ïîèñê êíèã, ñîäåðæàùèõ: Directed graph



ÊíèãàÑòðàíèöû äëÿ ïîèñêà
Êîðìåí Ò., Ëåéçåðñîí ×., Ðèâåñò Ð. — Àëãîðèòìû: ïîñòðîåíèå è àíàëèç1213
Êîðìåí Ò., Ëåéçåðñîí ×., Ðèâåñò Ð. — Àëãîðèòìû: ïîñòðîåíèå è àíàëèç88
Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1)15
Ito K. — Encyclopedic Dictionary of Mathematics. Vol. 2186.B
Grimaldi R.P. — Discrete and combinatorial mathematics. An introduction333, 349, 357, 363—368, 372, 373, 394, 395, 530, 533, 657
Diestel R. — Graph Theory25, 108, 119
Saad Y. — Iterative Methods for Sparse Linear Systems71
Cameron P.J. — Combinatorics : Topics, Techniques, Algorithms160
Miller E., Sturmfels B. — Combinatorial Commutative Algebra197, 353
Meyer C.D. — Matrix analysis and applied linear algebra202
Haynes T.W., Hedetniemi S.T., Slater P.J. — Fundamentals of domination in graphs211
Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2)15
Clote P., Backofen R. — Computational Molecular Biology144
Bach E., Shallit J. — Algorithmic Number Theory (òîì 1)57
Brin M., Stuck G. — Introdution to dynamical system8, 56, 67
Rotman J.J. — An Introduction to the Theory of Groups356
Lorentzen L., Waadeland — Continued fractions and applications495
Mahmoud H.M. — Evolution of random search trees2
Diestel R. — Graph theory28, 49—50, 124, 135, 246, 376
Merris R. — Combinatorics395
Grotschel M., Lovasz L., Schrijver A. — Geometric Algorithms and Combinatorial Optimization18
Godsil C., Royle G. — Algebraic Graph Theory2
Engel K. — Sperner theory5
Velleman D.J. — How to Prove It: A Structured Approach183
Bapat R.B., Raghavan T.E., Rota G.C. (Ed) — Nonnegative Matrices and Applications4, 56, 220, 223
Brouwer A.E., Cohen A.M., Neumaier A. — Distance-Regular Graphs433
McEneaney W.M. — Max-Plus Methods for Nonlinear Control and Estimation81
Bondy J.A., Murty U.S.R. — Graph theory with applications171
Wicker S.B., Kim S. — Fundamentals of Codes, Graphs, and Iterative Decoding80, 95
Golumbic M.C., Trenk A. — Tolerance Graphs219
Williamson S. — Combinatorics for computer science200, 224, 259
Sipser M. — Introduction to the theory of computation12
Sandor J., Mitrinovic D.S., Crstici B. — Handbook of Number Theory II183
Hein J.L. — Discrete Mathematics44
Knuth D.E. — The art of computer programming (vol. 2 Seminumerical Algorithms)480—481, 484—485
Ross Sh.M. — Topics in Finite and Discrete Mathematics150
Ito K. — Encyclopedic Dictionary of Mathematics186. B
Du D. (ed.), Pardalos P. (ed.) — Handbook of combinatorial optimization: supplement volume A311
Irvine K.R. — Assembly Language for Intel-Based Computers211
Barton J.J., Nackman L.R. — Scientific and engineering C++239
Kolman B., Busby R.C., Cutler S.C. — Discrete Mathematical Structuressee “Digraph”
Lawvere F.W., Schanuel S.H. — Conceptual Mathematics: A First Introduction to Categoriessee Graph
Duffie D. — Security Markets. Stochastic Models104
von zur Gathen J., Gerhard J. — Modern computer algebra398, 442, 643
Watt D.A. — Java collections: an introduction to abstract data types, data structures, and algorithmssee “Digraph”, “Graph”
Alagić S., Arbib M.A. — The Design of Well-Structured and Correct Programs202
Luger G.F., Stubblefield W.A. — Artificial Intelligence: Structures and Strategies for Complex Problem Solving85
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 Overview154, 464
Strang G. — Linear Algebra and Its Applications102
Hein J.L. — Discrete Structures, Logic, and Computability43
Beckenbach E.F. (editor), Polya G., Lehmer D.H. and others — Applied combinatorial mathematics186
Papadimitriou C.H., Steiglitz K. — Combinatorial Optimization: Algorithms and Complexitysee “Digraph”
Saad Y. — Iterative methods for sparse linear systems75
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: Parsingsee “Graph”
Csiszar I., Körner J. — Information Theory: Coding Theorems for Discrete Memoryless Systems245
Murota K. — Discrete convex analysis52, 88
Bóna M. — A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory190
Olver P.J., Shakiban C. — Applied linear. algebra123
Cook W.J., Cunningham W.H., Pulleyblank W.R. — Combinatorial optimization19
Hein J.L. — Theory of Computation: An Introduction19
Graver J.E. — Counting on Frameworks: Mathematics to Aid the Design of Rigid Structures159
Kreher D.L., Stinson D.R. — Combinatorial Algorithms: Generation, Enumeration and Search62, 88
Jategaonkar A.V. — Localization in Noetherian Rings(see Link graph)
Ore O., Wilson R.J. — Graphs and Their Uses63, 149
Neumann M., Berman A., Stern R.J. — Nonnegative matrices in dynamic systems19
Wilkinson L., Wills G., Rope D. — The Grammar aof Graphics377
Berman A. — Nonnegative Matrices in the Mathematical Sciences29
Ding-Zhu D., Ker-I K. — Problem solving in automata, languages, and complexity16, see also "Graph"
Shafer G. — The Art of Causal Conjecture386—391
Carl D. Meyer — Matrix Analysis and Applied Linear Algebra Book and Solutions Manual202
Harary F. — Graph Theory10
Minc H. — Nonnegative Matrices76
Lewis H.R., Papadimitriou C.H. — Elements of the Theory of Computation14
Marmanis H., Babenko D. — Algorithms of the intelligent web34
Seymour L. — Schaum's Outline of Theory and Problems of Discrete Math233—235
Rall L.B. — Automatic Differentiation: Techniques and Applications6
Michel A., Liu D. — Qualitative analysis and synthesis of recurrent neural networks108, 109
Bapat R.B., Raghavan T.E.S. — Nonnegative Matrices and Applications4, 56, 220, 223
Liu C.L. — Introduction to combinatorial mathematics168
van Lint J.H., Wilson R.M. — Course in Combinatorics2
Roberts F. S. — Graph theory and its applications to problems of societysee "Digraph"
Gibbons A. — Algorithmic graph theorysee "Digraph"
Gibbons A. — Algorithmic graph theorysee "Digraph"
Hopcroft J.E., Ullman J.D. — Introduction to automata theory, languages, and computation2 (see also Transition diagram)
Brookshear J. — Computer Science154, 464
Iverson K.E. — A Programming Language46
Averbach B., Chein O. — Problem solving through recreational mathematics190
Beckenbach E.F. (ed.) — Applied Combinatorial Mathematics186
Gries D. — A Logical Approach to Discrete Math423
Aho A.V., Ullman J.D. — The Theory of Parsing, Translation, and Compiling. Volume II: Compilingsee "Graph, directed"
Aldous J.M., Wilson R. — Graphs and Applications: An Introductory Approach16
Hinrichsen D., Pritchard A. — Mathematical Systems Theory I: Modelling, State Space Analysis, Stability and Robustness50, 164—166
Hsu D.F. — Cyclic Neofields and Combinatorial Designs4, 169
Bjorner A. — Oriented Matroids1
Lipschutz S., Lipson M.L. — Schaum's outline of theory and problems of discrete mathematics233—235
Strang G. — Introduction to Applied Mathematics93, 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 complexitysee "Digraph"
Hazewinkel M. — Handbook of Algebra (÷àñòü 1)531
Hartmann A.K., Rieger H. — Optimization Algorithms in Physics37, 47, 96, 102
Seress Á. — Permutation Group Algorithms11
Grimaldi R.P., Rothman D.J. — Discrete and Combinatorial Mathematics: An Applied Introduction337, 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 Graphs4
Berman A., Shaked-Monderer N. — Completely Positive Matrices38
Anthony M. — Discrete Mathematics Of Neural Networks115
Nahin P.J. — When Least Is Best: How Mathematicians Discovered Many Clever Ways to Make Things as Small (or as Large) as Possible290—293
Godsil C. — Algebraic Combinatorics (Chapman Hall Crc Mathematics Series)354
Sipser M. — Introduction to the Theory of Computation12
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 21002
Gill A. — Applied Algebra for the Computer Sciences78, 364, 395
Kolman B., Busby R.C., Ross S. — Discrete Mathematical Structuressee "Digraph"
Shen A. — Algorithms and Programming88
Jones N.D. — Computability and complexity from a programming perspective431
Grimaldi R.P. — Student Solutions Manual for Discrete and Combinatorial Mathematics337, 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 physics76, 92, 167
Berman A., Plemmons R.J. — Nonnegative matrices in the mathematical sciences29
Voit E. — Computational Analysis of Biochemical Systems: A Practical Guide for Biochemists and Molecular Biologists61, 63
V. Bryant — Independence theory in combinatorics: An introductory account with applications to graphs and transversals (Chapman and Hall mathematics series)80
blank
HR
@Mail.ru
© Ýëåêòðîííàÿ áèáëèîòåêà ïîïå÷èòåëüñêîãî ñîâåòà ìåõìàòà ÌÃÓ, 2004-2024
Ýëåêòðîííàÿ áèáëèîòåêà ìåõìàòà ÌÃÓ | Valid HTML 4.01!| Valid CSS! Î ïðîåêòå