|
|
 |
| Ðåçóëüòàò ïîèñêà |
Ïîèñê êíèã, ñîäåðæàùèõ: Bipartite graph
| Êíèãà | Ñòðàíèöû äëÿ ïîèñêà | | Êîðìåí Ò., Ëåéçåðñîí ×., Ðèâåñò Ð. — Àëãîðèòìû: ïîñòðîåíèå è àíàëèç | 91 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 6, 14, 386, 397, 407, 947 | | Ito K. — Encyclopedic Dictionary of Mathematics. Vol. 2 | 186.C | | Grimaldi R.P. — Discrete and combinatorial mathematics. An introduction | 561, 580, 683, 684, 689 | | Devroye L. — Generation of non-uniform random variates | 671 | | Fishman G.S. — Monte Carlo: concepts, algorithms, and applications | 452 | | Saad Y. — Iterative Methods for Sparse Linear Systems | 82, 112 | | Cameron P.J. — Combinatorics : Topics, Techniques, Algorithms | 177, 185, 292—294 | | Haynes T.W., Hedetniemi S.T., Slater P.J. — Fundamentals of domination in graphs | 6 | | Matousek J. — Lectures on Discrete Geometry (some chapters) | 12 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 6, 14, 386, 397, 407, 947 | | Honsberger R. — Mathematical Delights | 4 | | Merris R. — Combinatorics | 361, 393 | | Grotschel M., Lovasz L., Schrijver A. — Geometric Algorithms and Combinatorial Optimization | 18, 200, 204, 208—210, 229—233, 273—274, 279, 305 | | Lando S.K., Zvonkin A.K. — Graphs on Surfaces and Their Applications | 41 | | Laywine C.F., Mullen G.L. — Discrete mathematics using Latin squares | 287 | | Lawler E.L. — Combinatorial Optimization: Networks and Matroids | 23 | | Godsil C., Royle G. — Algebraic Graph Theory | 6 | | Engel K. — Sperner theory | 16 | | Dyke Ph.P.G. — Managing Mathematical Projects - with Success! | 88 | | Spinrad J. — Graph theory | 86 | | Gelfand I.M., Kapranov M.M., Zelevinsky A.V. — Discriminants, Resultants, and Multidimensional Determinants | 247 | | Burke E.K., Kendall G. — Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques | 58 (see also “Graph, bipartite”) | | Brouwer A.E., Cohen A.M., Neumaier A. — Distance-Regular Graphs | 135, 140, 434 | | Bondy J.A., Murty U.S.R. — Graph theory with applications | 4 | | Anderson I. — A first course in discrete mathematics | 52 | | Wicker S.B., Kim S. — Fundamentals of Codes, Graphs, and Iterative Decoding | 79, 80, 137, 177 | | Golumbic M.C., Trenk A. — Tolerance Graphs | 53, 60 | | Williamson S. — Combinatorics for computer science | 207, 208, 286, 303, 387 | | Berlekamp E.R., Conway J.H., Guy R.K. — Winning Ways for Your Mathematical Plays, Vol. 1 | 217, 224 | | Sipser M. — Introduction to the theory of computation | 332 | | Papadimitriou C.H. — Computational Complexity | 11, 213 | | Ito K. — Encyclopedic Dictionary of Mathematics | 186.C | | Ionin Y.J., Shrikhande M.S. — Combinatorics of Symmetric Designs | 19 | | Beckenbach E.F. (editor), Polya G., Lehmer D.H. and others — Applied combinatorial mathematics | 363 | | Chung F.R.K. — Spectral Graph Theory | 92 | | Brualdi R.A., Ryser H.J. — Combinatorial Matrix Theory | 44, 107—144, 178, 317 | | Papadimitriou C.H., Steiglitz K. — Combinatorial Optimization: Algorithms and Complexity | 21 | | Tucker À. — Applied Combinatorics | 4, 31, 75, 156, 423 | | Bollobás B. — Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability | 6 | | Saad Y. — Iterative methods for sparse linear systems | 87, 119, 335 | | Nishizeki T., Chiba N. — Planar Graphs: Theory and Algorithms (North-Holland Mathematics Studies) | 6, 10, 164 | | Dong F.M., Teo K.L., Koh K.M. — Chromatic Polynomials And Chromaticity Of Graphs | XX | | Murota K. — Discrete convex analysis | 89 | | Hammer P.L., Rudeanu S. — Boolean methods in operations research and related areas | 237 ff. | | D'Angelo J.P., West D.B. — Mathematical Thinking: Problem-Solving and Proofs | 215, 9, 225, 231 | | Vanderbei R.J. — Linear Programming: Foundations and Extensions | 241 | | Berge C. — Graphs and Hypergraphs | 7 | | Cook W.J., Cunningham W.H., Pulleyblank W.R. — Combinatorial optimization | 47, 48, 53, 59, 60, 92, 99, 118, 127, 128, 130, 131, 133, 134, 136, 137, 145, 163, 181, 182, 188 | | Graver J.E. — Counting on Frameworks: Mathematics to Aid the Design of Rigid Structures | 39 | | Holz M., Podewski K.-P., Steffens K. — Injective Choice Functions | 34 | | Kreyszig E. — Advanced engineering mathematics | 982, 985 | | Mirsky L. — Transversal theory. An account of some aspects of combinatorial mathematics | 21 | | Ore O., Wilson R.J. — Graphs and Their Uses | 54, 149 | | Harary F. — Graph Theory | 17 | | Gatermann K. — Computer Algebra Methods for Equivariant Dynamical Systems | 33 | | Minc H. — Nonnegative Matrices | 101 | | Rota G.-C. — Studies in combinatorics (MAA Studies in Mathematics, volume 17) | 81 | | Tucker A. — Applied Combinatorics | 4, 31, 75, 156, 423 | | Villareal R.H. — Monomial algebras | 163 | | Liu C.L. — Introduction to combinatorial mathematics | 183, 281 | | Laywine C.F., Mullen G.L. — Discrete Mathematics Using Latin Squares | 287 | | van Lint J.H., Wilson R.M. — Course in Combinatorics | 20, 35, 45, 54, 289, 399 | | Roberts F. S. — Graph theory and its applications to problems of society | 50, 52, 53, 80 | | Gibbons A. — Algorithmic graph theory | 4 | | Gibbons A. — Algorithmic graph theory | 4 | | Sachkov V.N., Tarakanov V.E. — Combinatorics of Nonnegative Matrices | 173 | | Yap H.P. — Total Colourings of Graphs | 2 | | Averbach B., Chein O. — Problem solving through recreational mathematics | 177, 402, 403 | | Beckenbach E.F. (ed.) — Applied Combinatorial Mathematics | 363 | | Gries D. — A Logical Approach to Discrete Math | 436 | | Aldous J.M., Wilson R. — Graphs and Applications: An Introductory Approach | 6, 12, 47, 55, 155 | | Mott J.L., Kandel A., Baker T.P. — Discrete Mathematics For Computer Scientists And Mathematicians | 457, 547—548, see also "Directed bipartite graphs" | | Mott J., Kandel A., Baker T. — Discrete mathematics for computer scientists and mathematicians | 457, 547—548, see also "Directed bipartite graphs" | | Villarreal R.H. — Monomial Algebras | 163 | | Devroye L. — Non-Uniform Random Variate Generation | 671 | | Du D.-Z., Ko K.-I. — Theory of computational complexity | 149 | | Hartmann A.K., Rieger H. — Optimization Algorithms in Physics | 229, 231—241 | | Grimaldi R.P., Rothman D.J. — Discrete and Combinatorial Mathematics: An Applied Introduction | 541, 542, 558, 659, 660, 662—665 | | Lemm J.M., Meurant G. — Computer Solution of Large Linear Systems | 161, 162 | | Di Battista G. — Graph Drawing: Algorithms for the Visualization of Graphs | 77 | | Gossett E. — Discrete Math with Proof | 596 | | Berlekamp E., Conway J., Guy R. — Winning Ways for your mathematical plays.Volume 2. | 217, 224 | | Godsil C. — Algebraic Combinatorics (Chapman Hall Crc Mathematics Series) | 353 | | Berlekamp E.R., Conway J.H., Guy R.K. — Winning Ways for your mathematical plays | 217, 224 | | Scheinerman E.A. — Mathematics: A Discrete Introduction | 430, 544 | | Sipser M. — Introduction to the Theory of Computation | 304 | | Gill A. — Applied Algebra for the Computer Sciences | 382 | | Shen A. — Algorithms and Programming | 130 | | Grimaldi R.P. — Student Solutions Manual for Discrete and Combinatorial Mathematics | 541, 542, 558, 659, 660, 662—665 | | D'Angelo J.P., West D.B. — Mathematical thinking: problem-solving and proofs | 215—219, 225, 231 | | Chvatal V. — Linear programming | 332, 372, 388 | | V. Bryant — Independence theory in combinatorics: An introductory account with applications to graphs and transversals (Chapman and Hall mathematics series) | 5, 29 |
|
|
|
|
Î ïðîåêòå