| Книга | Страницы для поиска |
| Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 88 |
| Гудрич М.Т., Тамассия Р. — Структуры данных и алгоритмы в Java | 576, 606 |
| Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 15 |
| Grimaldi R.P. — Discrete and combinatorial mathematics. An introduction | 363, 530 (see also “Directed graph”) |
| Stanley R.P. — Enumerative Combinatorics: Volume 1 | 241, 293 |
| Diestel R. — Graph Theory | see “Directed graph” |
| Cvetkovic D., Doob M., Sachs H. — Spectra of graphs. Theory and application | 11* |
| Cameron P.J. — Combinatorics : Topics, Techniques, Algorithms | 160, 172—173 |
| Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 15 |
| Palade V., Jain L.C., Bocaniala C.D. — Computational Intelligence in Fault Diagnosis | 336—338, 341—343, 345, 349—352 |
| Mahmoud H.M. — Evolution of random search trees | 2 |
| Diestel R. — Graph theory | see directed graph |
| Grotschel M., Lovasz L., Schrijver A. — Geometric Algorithms and Combinatorial Optimization | 18, 18—20 |
| Lawler E.L. — Combinatorial Optimization: Networks and Matroids | 20 |
| Engel K. — Sperner theory | 5 |
| Akmajian A., Demers R.A., Farmer A.K. — Linguistics. An Introduction to Language and Communications | 78 |
| Brouwer A.E., Cohen A.M., Neumaier A. — Distance-Regular Graphs | 232 |
| Bondy J.A., Murty U.S.R. — Graph theory with applications | 171 |
| Higgins P. — Techniques of Semigroup Theory | 69 |
| Koblitz N. — A course in number theory and cryptography | 54, 59 |
| Anderson I. — A first course in discrete mathematics | 81 |
| Golumbic M.C., Trenk A. — Tolerance Graphs | 219 (see also “Directed graph”) |
| Humphreys J.F., Prest M.Y. — Numbers, Groups and Codes | 107, see directed graph directed graph (of a relation) |
| Finch S.R. — Mathematical constants | 309 |
| Hein J.L. — Discrete Mathematics | 44 |
| Goutsias J., Vincent L., Bloomberg D.S. — Mathematical morphology and its applications to image signal processing | 342 |
| Ross Sh.M. — Topics in Finite and Discrete Mathematics | see “Directed graph” |
| Marchette D.J. — Random Graphs for Statistical Pattern Recognition | 6, 132 |
| Irvine K.R. — Assembly Language for Intel-Based Computers | 211 |
| Kolman B., Busby R.C., Cutler S.C. — Discrete Mathematical Structures | 112 |
| Watt D.A. — Java collections: an introduction to abstract data types, data structures, and algorithms | 400—403 (see also “AMDigraph”, “ASDigraph”, “ESDigraph”) |
| Knuth D.E. — The art of computer programming (Vol. 1. Fundamental algorithms) | 371, see “Directed graph” |
| 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 | 20 |
| Nishizeki T., Chiba N. — Planar Graphs: Theory and Algorithms (North-Holland Mathematics Studies) | 3 |
| Ebbinghaus H.-D., Flum J. — Finite Model Theory | 1 |
| Vanderbei R.J. — Linear Programming: Foundations and Extensions | 213 |
| Olver P.J., Shakiban C. — Applied linear. algebra | 123, 301 |
| Hein J.L. — Theory of Computation: An Introduction | 19 |
| Kreyszig E. — Advanced engineering mathematics | 955 |
| Steeb W.- H. — Problems and Solutions in Introductory and Advanced Matrix Calculus | 228 |
| Marques de Sa J.P. — Pattern recognition: concepts, methods, and applications | 248 |
| Knuth D.E. — The art of computer programming (vol. 1 Fundаmental algorithms) | 372; see Directed graph |
| Ore O., Wilson R.J. — Graphs and Their Uses | 63, 149 |
| Ding-Zhu D., Ker-I K. — Problem solving in automata, languages, and complexity | see "Directed graph" |
| Harary F. — Graph Theory | 198 |
| Liu B., Lai H.-J. — Matrices in Combinatorics and Graph Theory (Network Theory and Applications Volume 3) | 280 |
| van Lint J.H., Wilson R.M. — Course in Combinatorics | 2 |
| Diestel R. — Graph Theory | (see Directed graph) |
| Roberts F. S. — Graph theory and its applications to problems of society | 3 |
| Gibbons A. — Algorithmic graph theory | 5 |
| Gibbons A. — Algorithmic graph theory | 5 |
| Yap H.P. — Total Colourings of Graphs | 3 |
| Hopcroft J.E., Ullman J.D. — Introduction to automata theory, languages, and computation | see Directed graph |
| Averbach B., Chein O. — Problem solving through recreational mathematics | see Graph, directed |
| Beckenbach E.F. (ed.) — Applied Combinatorial Mathematics | 186 |
| Giarratano J.C., Riley G.D. — Expert Systems: Principles and Programming | 98 |
| Gries D. — A Logical Approach to Discrete Math | 423 |
| Aldous J.M., Wilson R. — Graphs and Applications: An Introductory Approach | 16, 85 |
| Du D.-Z., Ko K.-I. — Theory of computational complexity | 149 |
| Grimaldi R.P., Rothman D.J. — Discrete and Combinatorial Mathematics: An Applied Introduction | 349, 352, 514, see also "Directed graph" |
| Lemm J.M., Meurant G. — Computer Solution of Large Linear Systems | 35, 168, 469, 470 |
| Di Battista G. — Graph Drawing: Algorithms for the Visualization of Graphs | 4, 33 |
| Gossett E. — Discrete Math with Proof | 641, see "Directed graph" |
| Jablan S., Sazdanovic R. — LinKnot: knot theory by computer | 1 |
| Sachkov V.N. — Combinatorial methods in discrete mathematics | 4, 11, 166 |
| Berman A., Shaked-Monderer N. — Completely Positive Matrices | 38 |
| Lins S. — Gems, computers, and attractors for 3-manifolds | 106 |
| Kolman B., Busby R.C., Ross S. — Discrete Mathematical Structures | 111 |
| Joyner D. — Adventures in group theory: Rubik's cube, Merlin's machine, and other mathematical toys | 144 |
| Grimaldi R.P. — Student Solutions Manual for Discrete and Combinatorial Mathematics | 349, 352, 514, see also "Directed graph" |
|
|
О проекте