Зарегистрироваться
Восстановить пароль
FAQ по входу

Теория графов

Ищем доверенных пользователей для раздела Математика

Вы компетентны в тематике этого раздела и имеете профессиональный опыт в данном направлении?
Вы хотите упорядочить имеющиеся здесь материалы и поддерживать порядок в будущем?
Вы готовы консультировать других пользователей?
Тогда вас, возможно, заинтересует возможность стать доверенным в этом разделе.

Доверенные пользователи и модераторы раздела

Prentice Hall, 1993. — 863 p. Network flows is an exciting field that brings together what many students, practitioners, and researchers like best about the mathematical and computational sciences. It couples deep intellectual content with a remarkable range of applicability, covering literally thousands of applications in such wide-ranging fields as chemistry and physics,...
  • №1
  • 9,36 МБ
  • добавлен
  • изменен
Prentice Hall, 1993. — 863 p. Network flows is an exciting field that brings together what many students, practitioners, and researchers like best about the mathematical and computational sciences. It couples deep intellectual content with a remarkable range of applicability, covering literally thousands of applications in such wide-ranging fields as chemistry and physics,...
  • №2
  • 15,22 МБ
  • добавлен
  • изменен
North Holland, 1989. – 424 p. – ISBN: 0444705384, 9780444705389 Annals of Discrete Mathematics. In the 1970s, there were few graph theorists among the 5000 members of the Japan Mathematics Society. Graph Theory was not even considered a suitable area in which to write a Ph.D. dissertation. The situation has changed over the last few years through the efforts of a small but...
  • №3
  • 4,81 МБ
  • добавлен
  • изменен
Springer, 2003. — 457 p. In recent years, there has been a significant movement away from traditional calculus courses toward courses on discrete mathematics. The impetus for this has undoubtedly been due in part to the increasing importance of the computer, and the consequence has been a proliferation of courses and books entitled Discrete Mathematics, Finite Mathematics,...
  • №4
  • 2,89 МБ
  • добавлен
  • изменен
Springer, 2000. - 457 pages. Discrete Mathematics is one of the fastest growing areas in mathematics today with an ever-increasing number of courses in schools and universities. Graphs and Applications is based on a highly successful Open University course and the authors have paid particular attention to the presentation, clarity and arrangement of the material, making it...
  • №5
  • 30,85 МБ
  • дата добавления неизвестна
  • изменен
Издательство North-Holland, 1985, -481 pp. The idea for this book grew out of the successful workshop "Cycles in Graphs 1982" held at Simon Fraser University 5 July - 20 August 1982. The primary purpose of the workshop was to gather the world's leading experts on cycles in graphs and have them discuss what they felt were the outstanding problems in the area. There were only four...
  • №6
  • 5,66 МБ
  • добавлен
  • изменен
Издательство North-Holland, 1985, -481 pp. The idea for this book grew out of the successful workshop "Cycles in Graphs 1982" held at Simon Fraser University 5 July - 20 August 1982. The primary purpose of the workshop was to gather the world's leading experts on cycles in graphs and have them discuss what they felt were the outstanding problems in the area. There were only four...
  • №7
  • 2,13 МБ
  • добавлен
  • изменен
Providence: American Mathematical Society, 2013. — 258 p. This collection is related to the Workshop of the 10th DIMACS Implementation Challenge, which took place in Atlanta, Georgia (USA) on February 13-14, 2012. The purpose of DIMACS Implementation Challenges1 is to assess the practical performance of algorithms in a respective problem domain. These challenges are scientific...
  • №8
  • 6,57 МБ
  • добавлен
  • изменен
Springer, 2012. - 305 Pages. ISBN: 1461445280 Graph theory experienced a tremendous growth in the 20th century. One of the main reasons for this phenomenon is the applicability of graph theory in other disciplines such as physics, chemistry, psychology, sociology, and theoretical computer science. This textbook provides a solid background in the basic topics of graph theory,...
  • №9
  • 2,28 МБ
  • добавлен
  • изменен
Издательство McGraw-Hill, 1997, -302 pp. The theory of graphs, with its diverse applications in natural and social sciences in general and in theoretical computer science in particular, is becoming an important component of the mathematics curriculum in colleges and universities all over the world. This book presents the basic concepts of contemporary graph theory in a sequence...
  • №10
  • 33,08 МБ
  • добавлен
  • изменен
Springer, 2018. — 654 p. — (Springer Monographs in Mathematics). — ISBN 978-3-319-71839-2. This edited volume offers a detailed account on the theory of directed graphs from the perspective of important classes of digraphs, with each chapter written by experts on the topic. Outlining fundamental discoveries and new results obtained over recent years, this book provides a...
  • №11
  • 12,43 МБ
  • добавлен
  • изменен
Издательство Springer, 2007, -772 pp. Graph theory is a very popular area of discrete mathematics with not only numerous theoretical developments, but also countless applications to practical problems. As a research area, graph theory is still relatively young, but it is maturing rapidly with many deep results having been discovered over the last couple of decades. The theory...
  • №12
  • 3,49 МБ
  • добавлен
  • изменен
Springer-Verlag London Limited – 2009, 818 pages, 2nd edition. ISBN: 1852332689, 9781848009974. The theory of directed graphs has developed enormously over recent decades, yet this book (first published in 2000) remains the only book to cover more than a small fraction of the results. New research in the field has made a second edition a necessity. Substantially revised,...
  • №13
  • 3,77 МБ
  • добавлен
  • изменен
Springer, 2016. — 127 p. This book was motivated by the notion that some of the underlying difficulty in challenging instances of graph-based problems (e.g., the Traveling Salesman Problem) may be “inherited” from simpler graphs which – in an appropriate sense – could be seen as “ancestors” of the given graph instance. The authors propose a partitioning of the set of...
  • №14
  • 1,70 МБ
  • добавлен
  • изменен
L.: Springer, 2014. - 193p. This new edition illustrates the power of linear algebra in the study of graphs. The emphasis on matrix techniques is greater than in other texts on algebraic graph theory. Important matrices associated with graphs (for example, incidence, adjacency and Laplacian matrices) are treated in detail. Presenting a useful overview of selected topics in...
  • №15
  • 3,57 МБ
  • добавлен
  • изменен
Springer, 2010. - 171 pages. Graphs and Matrices provides a welcome addition to the rapidly expanding selection of literature in this field. As the title suggests, the book’s primary focus is graph theory, with an emphasis on topics relating to linear algebra and matrix theory. Information is presented at a relatively elementary level with the view of leading the student into...
  • №16
  • 972,94 КБ
  • дата добавления неизвестна
  • изменен
Cambridge University Press, 2008. - 347 pp. The availability of large data sets has allowed researchers to uncover complex properties such as large-scale fluctuations and heterogeneities in many networks, leading to the breakdown of standard theoretical frameworks and models. Until recently these systems were considered as haphazard sets of points and connections. Recent advances...
  • №17
  • 7,08 МБ
  • добавлен
  • изменен
New York: Academic Press, 1988. — 222 p. Contents: Introdeution Chromatic Polynomials Matroids and their Applications Paths, Circuits and Subdivisions Isometric Embeddings of Graphs Labellings of Graphs Polytopal Graphs Hypergraphs
  • №18
  • 41,89 МБ
  • добавлен
  • изменен
Oxford Clarendon Press, 1997. — 306 p. This new book introduces mathematicians to the applicability of graph theory to other areas, from number theory to linear algebra, neural networks, and finance. This is achieved through a series of expository chapters, each written by an expert in a different field. Each chapter has been carefully edited so that the terminology and notation...
  • №19
  • 2,57 МБ
  • добавлен
  • изменен
Cambridge: Cambridge University Press, 2015. — 387 p. Chromatic graph theory is a thriving area that uses various ideas of 'colouring' (of vertices, edges, and so on) to explore aspects of graph theory. It has links with other areas of mathematics, including topology, algebra and geometry, and is increasingly used in such areas as computer networks, where colouring algorithms form...
  • №20
  • 4,93 МБ
  • добавлен
  • изменен
Cambridge: CUP, 2012. - 342p. The rapidly expanding area of structural graph theory uses ideas of connectivity to explore various aspects of graph theory and vice versa. It has links with other areas of mathematics, such as design theory and is increasingly used in such areas as computer networks where connectivity algorithms are an important feature. Although other books cover...
  • №21
  • 3,72 МБ
  • добавлен
  • изменен
Cambridge University Press, 2009. — 368 p. — (Encyclopedia of Mathematics and its Applications 128) — ISBN 978-0-521-80230-7. The origins of topological graph theory lie in the 19th century, largely with the four colour problem and its extension to higher-order surfaces – the Heawood map problem. With the explosive growth of topology in the early 20th century, mathematicians like...
  • №22
  • 3,53 МБ
  • добавлен
  • изменен
Princeton: Princeton University Press, 2015. — 344 p. — ISBN 978-0-691-16381-9. The fascinating world of graph theory goes back several centuries and revolves around the study of graphs—mathematical structures showing relations between objects. With applications in biology, computer science, transportation science, and other areas, graph theory encompasses some of the most...
  • №23
  • 6,02 МБ
  • добавлен
  • изменен
Издательство North Holland, 1989, -424 pp. Graph theory has had an unusual development. Problems involving graphs first appeared in the mathematical folklore as puzzles (e.g. Konigsberg bridge problem). Later, graphs appeared in electrical engineering (Kirchhof's Law), chemistry, psychology and economics before becoming a unified field of study. Today, graph theory is one of...
  • №24
  • 3,38 МБ
  • добавлен
  • изменен
Издательство North Holland, 1976, -546 pp. Graph theory has had an unusual development. Problems involving graphs first appeared in the mathematical folklore as puzzles (e.g. Königsberg bridge problem). Later, graphs appeared in electrical engineering (Kirchhof’s Law), chemistry, psychology and economics before becoming aI unified field of study. Today, graph theory is one of...
  • №25
  • 3,79 МБ
  • добавлен
  • изменен
Издательство North-Holland, 1984, -385 pp. The purpose of this book is to present selected results on perfect graphs in a single volume. These take the form of reprinted classical papers, survey papers or new results. These are reprinted classical papers (sometimes with slight simplifications), survey papers written for this collection or new results. They concern different,...
  • №26
  • 4,55 МБ
  • добавлен
  • изменен
American Mathematical Society, 2012, -287 pp. A "quantum graph" is a graph considered as a one-dimensional complex and equipped with a differential operator ("Hamiltonian"). Quantum graphs arise naturally as simplified models in mathematics, physics, chemistry, and engineering when one considers propagation of waves of various nature through a quasi-one-dimensional (e.g.,...
  • №27
  • 2,79 МБ
  • добавлен
  • изменен
Brlin: Springer, 2007. - 120p. Eigenvectors of graph Laplacians have not, to date, been the subject of expository articles and thus they may seem a surprising topic for a book. The authors propose two motivations for this new LNM volume: (1) There are fascinating subtle differences between the properties of solutions of Schr?dinger equations on manifolds on the one hand, and...
  • №28
  • 2,48 МБ
  • добавлен
  • изменен
Informatik IV, Universitat Bonn Romerstr. 164, D-53117 Bonn, Germany email: blum@cs.uni-bonn.de October 26, 1999 38 pages Introduction and motivation De nitions and the general method Reduction to a reachability problem The solution of the reachability problem The correctness proof of MDFS An implementation of MDFS De nitions and the primal-dual method An implementation of the...
  • №29
  • 432,45 КБ
  • добавлен
  • изменен
Издательство North Holland, 1978, -305 pp. Annals of Discrete Mathematics, Number 3. Several of the papers were quickly and efficiently retyped by Mrs. J.E. Scutt. The editorial burden was greatly relieved by the excellent work of Mr. A.G. Thomason Linear separation of dominating sets in graphs Regularisable graphs Hamiltonian decompositions of graphs, directed graphs and...
  • №30
  • 2,16 МБ
  • добавлен
  • изменен
Издательство North Holland, 1982, -210 pp. Annals of Discrete Mathematics, Number 13 Proceedings of the Conference on Graph Theory, Cambridge The Cambridge Graph Theory Conference, held at Trinity College from 11 to 13 March 1981, brought together top ranking workers from diverse areas of the subject. The papers presented were by invitation only. This volume contains most of...
  • №31
  • 1,12 МБ
  • добавлен
  • изменен
Springer, 1998. — 394 pages. The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in-depth account of graph theory, written with such a student in mind; it reflects the current state of the subject and...
  • №32
  • 9,99 МБ
  • дата добавления неизвестна
  • изменен
Springer, 1998. — 394 p. — (Graduate Texts in Mathematics 184). — ISBN 978-0-387-98488-9. The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in-depth account of graph theory, written with such a student...
  • №33
  • 11,18 МБ
  • добавлен
  • изменен
Second Edition. — Cambridge University Press, 2001. — ISBN: 0521797225, 978-0521797221. This is a new edition of the now classic text. The already extensive treatment given in the first edition has been heavily revised by the author. The addition of two new sections, numerous new results and 150 references means that this represents an up-to-date and comprehensive account of...
  • №34
  • 17,97 МБ
  • добавлен
  • изменен
American Mathematical Society, 2008. — 202 p. A Course on the Web Graph provides a comprehensive introduction to state-of-the-art research on the applications of graph theory to real-world networks such as the web graph. It is the first mathematically rigorous textbook discussing both models of the web graph and algorithms for searching the web. After introducing key tools...
  • №35
  • 2,69 МБ
  • добавлен
  • изменен
American Mathematical Society, 2008. — 202 p. — (Graduate Studies in Mathematics). — ISBN: 0821844679, 9780821844670 A Course on the Web Graph provides a comprehensive introduction to state-of-the-art research on the applications of graph theory to real-world networks such as the web graph. It is the first mathematically rigorous textbook discussing both models of the web graph...
  • №36
  • 2,92 МБ
  • добавлен
  • изменен
Издательство Springer, 2008, -655 pp. The present project began with the intention of simply making minor revisions to our earlier book. However, we soon came to the realization that the changing face of the subject called for a total reorganization and enhancement of its contents. As with Graph Theory with Applications, our primary aim here is to present a coherent...
  • №37
  • 4,70 МБ
  • добавлен
  • изменен
Springer, 2008. — 654 p. Graph theory is a flourishing discipline containing a body of beautiful and powerful theorems of wide applicability. Its explosive growth in recent years is mainly due to its role as an essential structure underpinning modern applied mathematics – computer science, combinatorial optimization, and operations research in particular – but also to its...
  • №38
  • 6,13 МБ
  • дата добавления неизвестна
  • изменен
Elsevier Science Ltd, 1976. - 270 pages. The primary aim of this book is to present a coherent introduction to graph theory, suitable as a textbook for advanced undergraduate and beginning graduate students in mathematics and computer science. It provides a systematic treatment of the theory of graphs without sacrificing its intuitive and aesthetic appeal. Commonly used proof...
  • №39
  • 10,83 МБ
  • дата добавления неизвестна
  • изменен
Elsevier Science Ltd/North-Holland, 1976. — 270 p. — ISBN: 0444194517, 9780444194510 Graph theory is increasingly being used to model situations arising in the applied sciences. This text, in addition to treating the basic material in some depth, includes a wide variety of applications, both to real-world problems and to other branches of mathematics. Care has been taken to...
  • №40
  • 2,35 МБ
  • добавлен
  • изменен
Издательство North-Holland, 1982, -271 pp. Graph theory is increasingly being used to model situations arising in the applied sciences. This text, in addition to treating the basic material in some depth, includes a wide variety of applications, both to real-world problems and to other branches of mathematics. Care has been taken to select applications which actually make use...
  • №41
  • 5,10 МБ
  • добавлен
  • изменен
John Wiley, 2003. — 417. Understanding the complex world around us is a difficult task and simple principles that capture essential features of complex natural systems are always welcome. One such principle shared by a number of natural systems is their organization as networks of many interacting units: Interacting molecules in living cells, nerve cells in the brain, computers...
  • №42
  • 3,93 МБ
  • добавлен
  • изменен
Издательство Springer, 1983, -317 pp. Proceedings of a Conference held in Łagów, Poland, February 10-13, 1981 The International Graph Theory Conference held at Łagów Zamek (Castle), Poland. February 10 - 13, 1981 was dedicated, as are these proceedings, to the memory of Professor Kazimierz Kuratowski. In fact, graph theory represents only a small part of the work of...
  • №43
  • 1,99 МБ
  • добавлен
  • изменен
Boca Raton: CRC Press, 2019. — 218 p. Contents : Cover Half Title Title Copyright Dedication Table of Contents Acknowledgments Preface Basic definitions Partial graphs and subgraphs Chains and cycles Some classes of graphs Hamiltonian graphs Planar graphs Minimum spanning trees Non-graphical representations of a graph Computational geometry Delaunay triangulations Planar...
  • №44
  • 30,79 МБ
  • добавлен
  • изменен
Society for Industrial and Applied Mathematics, 1999, -321 pp. When dealing with special graph classes and algorithmic problems on them, a main source is the classical book of Golumbic, Algorithmic Graph Theory and Perfect Graphs. The book, however, appeared in 1980, and since that time many interesting new classes have been introduced. Therefore, it is probably useful to have...
  • №45
  • 2,64 МБ
  • добавлен
  • изменен
John Wiley, 2015. — 538 p. This book is about the application of graph visualization and analysis for business. Graph applications are a unique and valuable resource for discovering actionable insights in data. In recent years, analysts inside some of the world’s most innovative companies have been intensively exploring graph-based approaches to a gain deeper understanding of the...
  • №46
  • 29,68 МБ
  • добавлен
  • изменен
Издательство Springer, 1989, -509 pp. Graphs are studied in a wide variety of contexts. This is due to the fact that the con- cept of a graph is both general and convenient. It is convenient because mathematical as well as intuitive notions can often be formulated very easily in terms of symmetric relations; it is general because there are so many symmetric relations on a set....
  • №47
  • 17,85 МБ
  • добавлен
  • изменен
Издательство Springer, 2012, -265 pp. Algebraic graph theory is the branch of mathematics that studies graphs by using algebraic properties of associated matrices. In particular, spectral graph theory studies the relation between graph properties and the spectrum of the adjacency matrix or Laplace matrix. And the theory of association schemes and coherent configurations studies...
  • №48
  • 1,64 МБ
  • добавлен
  • изменен
New York: Addison-Wesley, 1990. — 352 p. Graph Theory has developed into a very active area of mathematical research. Whereas twenty years ago many mathematics departments had no graph theorists, it is now not uncommon to find several in a single department. A major impetus for this growth has certainly been the wide applicability of graph theory, especially in computer science....
  • №49
  • 2,74 МБ
  • добавлен
  • изменен
Издательство Birkhäuser, 2007, -238 pp. In this monograph, we describe the application of many graph-theoretic algorithms to a comprehensive environment of analysis of dynamic enterprise networks. Networks are ubiquitous, increasingly complex, and dynamic. Since they are part of all aspects of human life, their support of modern enterprise environments is paramount. Enterprises...
  • №50
  • 2,07 МБ
  • добавлен
  • изменен
Издательство Cambridge University Press, 1991, -251 pp. The three subjects of this book all began life in the provinces of applicable mathematics. Design theory originated in statistics (its name reflects its initial use, in experimental design); codes in information transmission; and graphs in the modelling of networks of a very general kind (in the first instance, the bridges...
  • №51
  • 1,35 МБ
  • добавлен
  • изменен
Издательство Springer, 1971, -212 pp. These are the proceedings of the first graph theory conference held in New York City. In spirit and scope it followed the graph theory conferences recently held in Ann Arbor and Kalamazoo: the contributors and participants were persons from Canada and the United States who are interested and very active in graph theory and its applications....
  • №52
  • 1,58 МБ
  • добавлен
  • изменен
Издательство North-Holland, 1978, -270 pp. This book is a compilation of some five hundred examples in graph theory. Its purpose is to serve as a reference for researchers, instructors and students, and it also can be used effectively as a supplementary text in graph theory courses and those in related areas. In view of the spectacular development of graph theory in recent...
  • №53
  • 2,21 МБ
  • добавлен
  • изменен
North-Holland, 1978. - 270 pages. It is a real pleasure, indeed an honor, for me to have been invited by Mike Capobianco and John Molluzzo to write an introduction to this imaginative and valuable addition to graph theory. Let me therefore present a few of my thoughts on the current status of graph theory and how their work contributes to the field. Graphs have come a long...
  • №54
  • 12,91 МБ
  • дата добавления неизвестна
  • изменен
University of Waterloo, Waterloo, Ontario, Canada 12 pages We give a data structure that allows arbitrary insertions and deletions on a planar point set P and supports basic queries on the convex hull of P, such as membership and tangent-finding. Updates take O(log^1+e n) amortized time and queries take O(log n) time each, where n is the maximum size of P and e is any fixed...
  • №55
  • 116,76 КБ
  • добавлен
  • изменен
Издательство Dover Publications, 1985, -461 pp. I have written this book with several objectives in mind: To teach the reader some of the topics in the youthful and exciting field of graph theory; To show how graphs are applicable to a wide variety of subjects, both within and outside mathematics; To increase the student’s knowledge of, and facility with, mathematical proof;...
  • №56
  • 7,07 МБ
  • добавлен
  • изменен
Издательство Springer, 1970, -282 pp. This volume constitutes the proceedings of the Conference on Graph Theory held at Western Michigan University in Kalamazoo, 31 October - 2 November 1968. Its participants represent a diverse spectrum of the mathematical scale. Those in attendance ranged from graduate students to outstanding research mathematicians, and their contributions to...
  • №57
  • 1,91 МБ
  • добавлен
  • изменен
CRC Press, 2015. — 640 p. — (Textbooks in Mathematics) — 6th Ed. — ISBN: 9781498735780 (eBook); 9781498735766 (Hardcover). Graphs & Digraphs masterfully employs student-friendly exposition, clear proofs, abundant examples, and numerous exercises to provide an essential understanding of the concepts, theorems, history, and applications of graph theory. Fully updated and...
  • №58
  • 10,07 МБ
  • добавлен
  • изменен
Издательство Chapman and Hall/CRC Press, 1996, -429 pp. Graph theory is a major area of combinatorics, and during recent decades, graph theory has developed into a major area of mathematics. In addition to its growing interest and importance as a mathematical subject, it has applications to many fields, including computer science and chemistry. As in the first edition of Graphs...
  • №59
  • 2,67 МБ
  • добавлен
  • изменен
5th ed. — CRC Press, 2015. — 600 p. — ISBN: 9781439826270, EISBN: 9781439826294 Continuing to provide a carefully written, thorough introduction, Graphs & Digraphs, Fifth Edition expertly describes the concepts, theorems, history, and applications of graph theory. Nearly 50 percent longer than its bestselling predecessor, this edition reorganizes the material and presents many...
  • №60
  • 9,43 МБ
  • добавлен
  • изменен
Hoboken: CRC Press, 2010. - 600p. Since graph theory was considered to have begun some 275 years ago, it has evolved into a subject with a fascinating history, a host of interesting problems and numerous diverse applications. While graph theory has developed ever-increasing connections with other areas of mathematics and a variety of scholarly fields, it is its beauty that has...
  • №61
  • 5,89 МБ
  • добавлен
  • изменен
6th ed. — CRC Press, 2016. — 625 p. — (Textbooks in Mathematics). — ISBN: 9781498735803 Graphs & Digraphs masterfully employs student-friendly exposition, clear proofs, abundant examples, and numerous exercises to provide an essential understanding of the concepts, theorems, history, and applications of graph theory. Fully updated and thoughtfully reorganized to make reading...
  • №62
  • 9,53 МБ
  • добавлен
  • изменен
Dover Publications, 2012. — 464 pages. ISBN: 0486483681 This comprehensive text offers undergraduates a remarkably student-friendly introduction to graph theory. Written by two of the field's most prominent experts, it takes an engaging approach that emphasizes graph theory's history. Unique examples and lucid proofs provide a sound yet accessible treatment that stimulates...
  • №63
  • 15,63 МБ
  • добавлен
  • изменен
Издательство CRC Press, 2009, -498 pp. Beginning with the origin of the Four Color Problem in 1852, the field of graph colorings has developed into one of the most popular areas of graph theory. This book introduces graph theory with a coloring theme. It explores connections between major topics in graph theory and graph colorings, including Ramsey numbers and domination, as...
  • №64
  • 3,15 МБ
  • добавлен
  • изменен
Название: Chen W. , Graph Theory and Its Engineering Applications Издательство: World Scientific Publishing Company Год: 1997 ISBN: 9810218591 Graphs are extremely useful in modelling systems in physical sciences and engineering problems, because of their intuitive diagrammatic nature. This text gives a reasonably deep account of material closely related to engineering...
  • №65
  • 10,46 МБ
  • дата добавления неизвестна
  • изменен
North-Holland, 1971. — 492. In the past four decades, we have witnessed a steady development of graph theory and its applications which in the last five to ten years have blossomed out into a new period of intense activity. Some measure of this rapid expansion is indicated by the observation that, over a period of only one and a half years, more than 500 new papers on graph...
  • №66
  • 5,75 МБ
  • добавлен
  • изменен
(Выходные данные отсутствуют) 53 pages Abstract Introduction Definitions and notation Labeling Method Labeling Method and Negative Cycles Labeling Algorithms Cycle Detection Strategies Algorithms Studied Experimental Setup Preliminary Experiment Problem Generators and Families Experimental Results Follow-Up Experiment Concluding Remarks
  • №67
  • 413,07 КБ
  • добавлен
  • изменен
Eigenvalues and the Laplacian of a graph. The Laplacian and eigenvalues. Basic facts about the spectrum of a graph. Eigenvalues of weighted graphs. Eigenvalues and random walks. Isoperimetric problems. History. The Cheeger constant of a graph. The edge expansion of a graph. The vertex expansion of a graph. A characterization of the Cheeger constant. Isoperimetric inequalities for...
  • №68
  • 190,11 КБ
  • добавлен
  • изменен
AMS, 1997. — 215 p. This monograph is an intertwined tale of eigenvalues and their use in unlocking a thousand secrets about graphs. The stories will be told - how the spectrum reveals fundamental properties of a graph, how spectral graph theory links the discrete universe to the continuous one through geometric, analytic and algebraic techniques, and how, through eigenvalues,...
  • №69
  • 7,43 МБ
  • добавлен
  • изменен
AMS, 1997. — 215 p. This monograph is an intertwined tale of eigenvalues and their use in unlocking a thousand secrets about graphs. The stories will be told - how the spectrum reveals fundamental properties of a graph, how spectral graph theory links the discrete universe to the continuous one through geometric, analytic and algebraic techniques, and how, through eigenvalues,...
  • №70
  • 3,84 МБ
  • добавлен
  • изменен
Издательство A K Peters, 1998, -156 pp. There is no question that Paul Erdős must be counted among the mathematical giants of the 20th century. His fundamental discoveries and profound contributions in so many areas of mathematics form a record which may never again be matched. However, there is one area in which Paul surpassed everyone else by a large margin: his ability to...
  • №71
  • 1,82 МБ
  • добавлен
  • изменен
University of Greifswald, 134 p. Introduction. Networks . Graphs. Connected graphs. Degree sequences. Trees and forests. The matrix of adjacency. Planar graphs. Digraphs. Further reading. Labeled Graphs . All graphs. The number of connected graphs. Eulerian graphs. The number of planar graphs. Random graphs. Tournaments. The Number of Labeled Trees ....
  • №72
  • 557,10 КБ
  • добавлен
  • изменен
World Scientific PubUshing Co. Pte. Ltd., 1991. — 332 p. — ISBN 9810204906, 9789810204907. This book is intended to be an introductory text for mathematics and computer science students at the second and third year levels in universities. It gives an introduction to the subject with sufficient theory for students at those levels, with emphasis on algorithms and applications....
  • №73
  • 4,29 МБ
  • добавлен
  • изменен
(Выходная информация отсутствует) 23 Pages We make several observations on the implementation of Edmonds' blossom algorithm for solving minimum-weight perfect-matching problems and we present computational results for geometric problem instances ranging in size from 1,000 nodes up to 5,000,000 nodes. A key feature in our implementation is the use of multiple search trees with an...
  • №74
  • 276,84 КБ
  • добавлен
  • изменен
Cambridge University Press, 2012. — 744 p. — (Encyclopedia of Mathematics and its Applications 138) — ISBN: 0521898331. The study of graph structure has advanced in recent years with great strides: finite graphs can be described algebraically, enabling them to be constructed out of more basic elements. Separately the properties of graphs can be studied in a logical language called...
  • №75
  • 3,70 МБ
  • добавлен
  • изменен
New York: Springer, 2014. — 220 p. The papers feature current research involved in the development and application of graph-based knowledge representation formalisms and reasoning techniques. They address the following topics: representations of constraint satisfaction problems; formal concept analysis; conceptual graphs; and argumentation frameworks.
  • №76
  • 5,16 МБ
  • добавлен
  • изменен
Cambridge: CUP, 2004. - 311p. Line graphs have the property that their least eigenvalue is greater than, or equal to, -2, a property shared by generalized line graphs and a finite number of so-called exceptional graphs. This book deals with all these families of graphs in the context of their spectral properties. Technical descriptions of these graphs are included in the...
  • №77
  • 1,07 МБ
  • добавлен
  • изменен
Cambridge: Cambridge University Press, 2009. — 378 p. This introductory text explores the theory of graph spectra: a topic with applications across a wide range of subjects, including computer science, quantum chemistry and electrical engineering. The spectra examined here are those of the adjacency matrix, the Seidel matrix, the Laplacian, the normalized Laplacian and the...
  • №78
  • 7,63 МБ
  • добавлен
  • изменен
N.-Y., Academic Press, 1980. - 368p. Монография посвящена спектрам собственных значений матрицы смежности графа и их связь со структурой графа, операциями над графом, группами автоморфизмов графа. Рассматривается возможность характеризации графа посредством спектров собственных значений. Предлагаются пути использования этих результатов как в теории графов и комбинаторике, так и...
  • №79
  • 5,09 МБ
  • добавлен
  • изменен
Издательство Cambridge University Press, 1997, -136 pp. The foundations of spectral graph theory were laid in the fifties and sixties, as a result of the work of a considerable number of mathematicians. Most of the early results are, like this book, concerned with the relation between spectral and structural properties of a graph. The investigation of such a relationship was...
  • №80
  • 1,90 МБ
  • добавлен
  • изменен
CRC Press, 2014. — 528 p. — ISBN: 1466584513, 9781466584518 The first book devoted exclusively to quantitative graph theory, Quantitative Graph Theory: Mathematical Foundations and Applications presents and demonstrates existing and novel methods for analyzing graphs quantitatively. Incorporating interdisciplinary knowledge from graph theory, information theory, measurement...
  • №81
  • 7,03 МБ
  • добавлен
  • изменен
Basel: Birkhauser, 2010. — 501 p. Filling a gap in literature, this self-contained book presents theoretical and application-oriented results that allow for a structural exploration of complex networks. The work focuses not only on classical graph-theoretic methods, but also demonstrates the usefulness of structural graph theory as a tool for solving interdisciplinary problems....
  • №82
  • 5,39 МБ
  • добавлен
  • изменен
New York: Wiley-VCH, 2016. - 287 p. This latest addition to the successful Network Biology series presents current methods for determining the entropy of networks, making it the first to cover the recently established Quantitative Graph Theory. An excellent international team of editors and contributors provides an up-to-date outlook for the field, covering a broad range of...
  • №83
  • 4,44 МБ
  • добавлен
  • изменен
Издательство Wiley-VCH, 2015, -280 pp. Network-based approaches have been used extensively in computational sciences and relevant disciplines such as mathematics, computer science, systems biology, operations research, and decision sciences. In particular, the development of network-based methods has been triggered from the breakthrough of the world wide web and other...
  • №84
  • 2,55 МБ
  • добавлен
  • изменен
Prentice Hall, 1974. - 480 pages. The last two decades have witnessed an upsurge of interest and activity in graph theory, particularly among applied mathematicians and engineers. Clear evidence of this is to be found in an unprecedented growth in the number of papers and books being published in the field. In 1957 there was exactly one book on the subject (namely, Konig's...
  • №85
  • 4,38 МБ
  • дата добавления неизвестна
  • изменен
Reprint Ed. — Dover Publications, 2017. — 469 p. — (Dover Books on Mathematics). — ISBN 10 0486807932. — ISBN 13 978-0486807935. This outstanding introductory treatment of graph theory and its applications has had a long life in the instruction of advanced undergraduates and graduate students in all areas that require knowledge of this subject. The first nine chapters constitute...
  • №86
  • 30,50 МБ
  • добавлен
  • изменен
Haryana: Institute of Mathematics, 2011. — 474 p. This text offers the most comprehensive and up-to-date presentation available on the fundamental topics in graph theory. It develops a thorough understanding of the structure of graphs, the techniques used to analyze problems in graph theory and the uses of graph theoretical algorithms in mathematics, engineering and computer...
  • №87
  • 5,44 МБ
  • добавлен
  • изменен
Springer, 2005. — 410 p. The third edition of this standard textbook of modern graph theory has been carefully revised, updated, and substantially extended. Covering all its major recent developments it can be used both as a reliable textbook for an introductory course and as a graduate text: on each topic it covers all the basic material in full detail, and adds one or two deeper...
  • №88
  • 2,43 МБ
  • дата добавления неизвестна
  • изменен
3rd Edition. — Springer, 2005. — 410 p. — (Graduate Texts in Mathematics 173). The third edition of this standard textbook of modern graph theory has been carefully revised, updated, and substantially extended. Covering all its major recent developments it can be used both as a reliable textbook for an introductory course and as a graduate text: on each topic it covers all the...
  • №89
  • 2,21 МБ
  • добавлен
  • изменен
4th Edition. — Springer, 2010. — 377 p. — (Graduate Texts in Mathematics 173). This standard textbook of modern graph theory, now in its fourth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of...
  • №90
  • 4,59 МБ
  • добавлен
  • изменен
4th Edition. — Springer, 2010. — 452 p. — (Graduate Texts in Mathematics 173). This standard textbook of modern graph theory, now in its fourth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of...
  • №91
  • 3,22 МБ
  • добавлен
  • изменен
5th Edition. — Springer-Verlag GmbH, Germany, 2017. — 448 p. — (Graduate Texts in Mathematics 173) — ISBN 3662536218. This standard textbook of modern graph theory, now in its fifth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably...
  • №92
  • 4,55 МБ
  • добавлен
  • изменен
Издательство World Scientific, 2005, -380 pp. For a century, one of the most famous problems in mathematics was to prove the four-colour theorem. This has spawned the development of many useful tools for solving graph colouring problems. In a paper in 1912, Birkhoff proposed a way of tackling the four-colour problem by introducing a function P(M,λ), defined for all positive...
  • №93
  • 8,50 МБ
  • добавлен
  • изменен
Berlin: Springer-Verlag, 1995. — 269 р. This book presents two major research results on the fast implementation of graph rewriting systems (GRS). First, it explores the class of so-called UBS-GRS, where the complexity of a rewriting step is linear instead of NP, showing for example that visual programming is possible by UBS graph rewriting. Second, an abstract machine for graph...
  • №94
  • 2,13 МБ
  • добавлен
  • изменен
Springer, 2014. — 552 p. — ISBN: 3662458020 This book constitutes the proceedings of the 22nd International Symposium on Graph Drawing, GD 2014, held in Würzburg, Germany, in September 2014. The 41 full papers presented in this volume were carefully reviewed and selected from 72 submissions. The back matter of the book also contains 2 page poster papers presented at the...
  • №95
  • 16,83 МБ
  • добавлен
  • изменен
Cambridge University Press, 2007. — 224 p. The theory of random graphs began in the late 1950s in several papers by Erdös and Rényi. In the late twentieth century, the notion of six degrees of separation, meaning that any two people on the planet can be connected by a short chain of people who know each other, inspired Strogatz and Watts to define the small world random graph...
  • №96
  • 981,93 КБ
  • добавлен
  • изменен
Издательство Springer, 2006, -373 pp. In the late 1960s and early 1970s, the concepts of graph transformation and graph grammars started to become of interest in picture processing and computer science. The main idea was to generalize well-known rewriting techniques from strings and trees to graphs, leading to graph transformations and graph grammars. In particular, the...
  • №97
  • 2,54 МБ
  • добавлен
  • изменен
Springer, 2018. — 475 p. — ISBN 331973234X. This clearly structured textbook/reference presents a detailed and comprehensive review of the fundamental principles of sequential graph algorithms, approaches for NP-hard graph problems, and approximation algorithms and heuristics for such problems. The work also provides a comparative analysis of sequential, parallel and distributed...
  • №98
  • 6,04 МБ
  • добавлен
  • изменен
Springer, 2018. — 475 p. — ISBN 331973234X. This clearly structured textbook/reference presents a detailed and comprehensive review of the fundamental principles of sequential graph algorithms, approaches for NP-hard graph problems, and approximation algorithms and heuristics for such problems. The work also provides a comparative analysis of sequential, parallel and distributed...
  • №99
  • 10,68 МБ
  • добавлен
  • изменен
Oxford, 2015. — 272 p. — ISBN 978–0–19–872646–3. The study of network theory is a highly interdisciplinary field, which has emerged as a major topic of interest in various disciplines ranging from physics and mathematics, to biology and sociology. This book promotes the diverse nature of the study of complex networks by balancing the needs of students from very different...
  • №100
  • 5,15 МБ
  • добавлен
  • изменен
Издательство Marcel Dekker, 1992, -499 pp. The 1970s ushered in an exciting era of research and applications of networks and graphs in operations research, industrial engineering, and related disciplines. Network optimization has been an important area of research and application in its own right and, in addition, is increasingly important as a component of broader and more...
  • №101
  • 3,49 МБ
  • добавлен
  • изменен
Cambridge University Press – 2012, 202 pages, 2nd edition ISBN: 0521517184, 9780521517188 Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from...
  • №102
  • 3,14 МБ
  • добавлен
  • изменен
American Mathematical Society, 2008, -718 pp. This volume contains papers written by some of the participants in the program "Analysis on Graphs and its Applications" (AGA) that ran at the Isaac Newton Institute for Mathematical Sciences (INI), Cambridge, from January 8th until June 29th 2007. The organizers of the program were M. Brown (UK), P. Exiier (Czech Republic), P....
  • №103
  • 6,18 МБ
  • добавлен
  • изменен
Издательство North-Holland, 1990-1991, -738 pp. Since writing my Ph.D. thesis, Hamiltonian and Eulerian graph theory have been the main topics of my research. Until 1975 I put more emphasis on Hamiltonian graph theory; since then, however, problems in Eulerian graph theory and related questions have been central to my work. This shift in research emphasis from Hamiltonian to...
  • №104
  • 4,54 МБ
  • добавлен
  • изменен
North-Holland, 1990-1991. — 738 p. Since writing my Ph.D. thesis, Hamiltonian and Eulerian graph theory have been the main topics of my research. Until 1975 I put more emphasis on Hamiltonian graph theory; since then, however, problems in Eulerian graph theory and related questions have been central to my work. This shift in research emphasis from Hamiltonian to Eulerian graphs...
  • №105
  • 11,00 МБ
  • добавлен
  • изменен
Wiley, 2009. — 282 p. — ISBN: 1848210701, 9781848210707 This book provides a pedagogical and comprehensive introduction to graph theory and its applications. It contains all the standard basic material and develops significant topics and applications, such as: colorings and the timetabling problem, matchings and the optimal assignment problem, and Hamiltonian cycles and the...
  • №106
  • 987,80 КБ
  • добавлен
  • изменен
Cambridge: Cambridge University Press, 2016. — 478 p. From social networks such as Facebook, the World Wide Web and the Internet, to the complex interactions between proteins in the cells of our bodies, we constantly face the challenge of understanding the structure and development of networks. The theory of random graphs provides a framework for this understanding, and in this...
  • №107
  • 2,05 МБ
  • добавлен
  • изменен
Paris: Societe Mathematique De France, 2015. — 204 p. We define the class of high dimensional graph manifolds. These are compact smooth manifolds supporting a decomposition into finitely many pieces, each of which is diffeomorphic to the product of a torus with a finite volume hyperbolic manifold with toric cusps. The various pieces are attached together via affine maps of the...
  • №108
  • 2,40 МБ
  • добавлен
  • изменен
New York: Springer, 2016. - 117p. Provides an up-to-date survey on pancyclic and bipartite graphs Surveys fundamental ideas of graph theory Creates a clear overview of the field via unified terminology This book is focused on pancyclic and bipancyclic graphs and is geared toward researchers and graduate students in graph theory. Readers should be familiar with the basic...
  • №109
  • 2,95 МБ
  • добавлен
  • изменен
Springer, 2018. — 282 p. — (Problem Books in Mathematics). — ISBN 978-3-319-97684-6. This second volume in a two-volume series provides an extensive collection of conjectures and open problems in graph theory. It is designed for both graduate students and established researchers in discrete mathematics who are searching for research ideas and references. Each chapter provides more...
  • №110
  • 5,05 МБ
  • добавлен
  • изменен
New York: Springer, 2016. — 300 p. This is the first in a series of volumes, which provide an extensive overview of conjectures and open problems in graph theory. The readership of each volume is geared toward graduate students who may be searching for research ideas. However, the well-established mathematician will find the overall exposition engaging and enlightening. Each...
  • №111
  • 8,07 МБ
  • добавлен
  • изменен
Cambridge: CUP, 1985. — 272 p. This is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with an interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colourability, flows in networks, matchings and traversals)...
  • №112
  • 13,56 МБ
  • добавлен
  • изменен
Издательство North-Holland, 1993, -406 pp. In the spectrum of mathematics, graph theory, as a recognized discipline, is a relative newcomer. The first formal paper is found in the work of Leonhard Euler in 1736. In recent years the subject has grown rapidly so that, in today's literature, mathematical and scientific, graph theory papers abound with new mathematical developments...
  • №113
  • 1,39 МБ
  • добавлен
  • изменен
Springer, 2001. — 453 p. — (Graduate Texts in Mathematics 207). — ISBN 0387952411. This book presents and illustrates the main tools and ideas of algebraic graph theory, with a primary emphasis on current rather than classical topics. It is designed to offer self-contained treatment of the topic, with strong emphasis on concrete examples. Algebraic graph theory is a combination of...
  • №114
  • 11,98 МБ
  • добавлен
  • изменен
(Выходные данные отсутсвуют) 39 pages Abstract Introduction Defintions and Notation Dijkstra's Algorithm Multi-level Buicket Implementation Experimental Setup Data Interpretation Experimental Results Conclusions
  • №115
  • 357,93 КБ
  • добавлен
  • изменен
Издательство Academic Press, 1980, -303 pp. Research in graph theory and its applications has increased considerably in recent years. Typically, the elaboration of new theoretical structures has motivated a search for new algorithms compatible with those structures. Rather than the arduous and systematic study of every new concept definable with a graph, the main task for the...
  • №116
  • 2,30 МБ
  • добавлен
  • изменен
Издательство Springer, 2004, -338 pp. Research in graph theory and its applications has increased considerably in recent years. Typically, the elaboration of new theoretical structures has motivated a search for new algorithms compatible with those structures. Rather than the arduous and systematic study of every new concept definable with a graph, the main task for the...
  • №117
  • 4,51 МБ
  • добавлен
  • изменен
Sprіnger, 2005. - 301 pages. Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering. The book contains eleven chapters written by experts in their respective fields, and covers a wide...
  • №118
  • 10,29 МБ
  • дата добавления неизвестна
  • изменен
Издательство Cambridge University Press, 2004, -274 pp. At the 13th Southeastern Conference on Combinatorics, Graph Theory and Computing (Boca Raton, 1982), a mathematical model of tolerance, called tolerance graphs, was introduced by Golumbic and Monma in order to generalize some of the well known applications associated with interval graphs. Their motivation was the need to...
  • №119
  • 2,25 МБ
  • добавлен
  • изменен
John Wiley, 1984. — 669. The present work has been conceived as a synthesis of many works and as a panorama, as complete as possible, of the theory and its applications up to the very last few years. Obviously, it has often proved impossible to include, within the main text itself, certain practical or theoretical developments which cater for extremely specialized interests....
  • №120
  • 5,78 МБ
  • добавлен
  • изменен
Springer, 2008. — 401. The origins of Graph Theory date back to Euler (1736) with the solution of the celebrated 'Koenigsberg Bridges Problem'; and to Hamilton with the famous 'Trip around the World' game (1859), stating for the first time a problem which, in its most recent version – the 'Traveling Salesman Problem' -, is still the subject of active research. Yet, it has been...
  • №121
  • 1,70 МБ
  • добавлен
  • изменен
Prague: Charles University, 2013. — 78 p. The chromatic polynomial. Flows and tensions. The Tutte polynomial.
  • №122
  • 982,38 КБ
  • добавлен
  • изменен
Издательство Benjamin/Cummings Publishing, 1988, -343 pp. This text is intended to be an introductory text in graph theory. As such, I feel it must reflect as many of the diverse aspects of this growing subject as possible. However, it was impossible to include every topic. Thus, I tried to concentrate on well-established topics, reflecting the primary techniques used in the...
  • №123
  • 2,86 МБ
  • добавлен
  • изменен
CRC Press, 2005. — 800 p. — ISBN 9781584885054. Already an international bestseller, with the release of this greatly enhanced second edition, Graph Theory and Its Applications is now an even better choice as a textbook for a variety of courses -- a textbook that will continue to serve your students as a reference for years to come. The superior explanations, broad coverage, and...
  • №124
  • 9,79 МБ
  • добавлен
  • изменен
CRC, 2003. - 1192 pages. The Handbook of Graph Theory is the most comprehensive single-source guide to graph theory ever published. Best-selling authors Jonathan Gross and Jay Yellen assembled an outstanding team of experts to contribute overviews of more than 50 of the most significant topics in graph theory-including those related to algorithmic and optimization approaches as...
  • №125
  • 9,22 МБ
  • дата добавления неизвестна
  • изменен
CRC Press, 2014. — 1633 p. — 2nd ed. — ISBN: 9781439880180 In the ten years since the publication of the best-selling first edition, more than 1,000 graph theory papers have been published each year. Reflecting these advances, Handbook of Graph Theory, Second Edition provides comprehensive coverage of the main topics in pure and applied graph theory. This second edition—over...
  • №126
  • 19,54 МБ
  • добавлен
  • изменен
American Mathematical Society, 1963. — 204 p. A student in the primary or secondary schools frequently has the notion that mathematics is concerned solely with number and measure. However, mathematics has always been much more than merely a quantitative science with applications to activities such as bookkeeping and money-changing; it is deeply concerned with logic and structure....
  • №127
  • 7,70 МБ
  • добавлен
  • изменен
University of Maine at Orono, 198, -221 pp. Mathematics is an exciting and accessible activity for many who only think of mathematics in terms of formulas and numbers. How would you like to discover new mathematical results? Impossible you say – perhaps not. In EXCURSION VI we learn about a result published in a major journal of graph theory which was discovered by a Professor...
  • №128
  • 1,16 МБ
  • добавлен
  • изменен
Выходные данные неизвестны. 10 pages. Introduction. Notation, Definitions, and an Overview of the Algorithm. The Preflow-Push Algorithm. The minimum cut algorithm. Time bonds for different implementations.
  • №129
  • 893,97 КБ
  • добавлен
  • изменен
Academic Press, 1994. - 249 pages. Improved by more than a dozen new exercises, an augmented section on labeling, the simplification of many proofs, and corrections suggested by classroom users and reviewers, this delightful text on graph theory retains and strengthens the appealing features of the original edition. It is an innovative and stimulating view of mathematics...
  • №130
  • 2,11 МБ
  • дата добавления неизвестна
  • изменен
B.: Heidermann Verlag, 2015. - 155p. Contents: Preface Preliminaries Graph Chessboards Labelling Sequences and Relations Some Classes of Gracefully Labelled Graphs Constructions of Gracefully Labelled Graphs Trees with Perfect Matching Graph Processor Bibliography
  • №131
  • 4,24 МБ
  • добавлен
  • изменен
Издательство Marcel Dekker, 1998, -500 pp. Within the last twenty-five years, concurrent with the growth of computer science, graph theory has seen explosive growth. Perhaps the fastest growing area within graph theory is the study of domination in graphs. Cockayne and Hedetniemi's survey paper on domination appeared in 1977 and contained 20 references. This survey paper...
  • №132
  • 3,98 МБ
  • добавлен
  • изменен
Издательство Marcel Dekker, 1998, -455 pp. The result of these objectives is a book that is appropriate for use at several different levels. Containing the only existing comprehensive bibliography on domination, it is a valuable reference book. It is suitable as a textbook for graduate level courses in graph theory and could also be used by advanced un- undergraduates. As a...
  • №133
  • 7,20 МБ
  • добавлен
  • изменен
Springer International Publishing AG, part of Springer Nature, 2018. — 343 p. — (Lecture Notes in Computer Science 10800) — ISBN 331975395. This volume pays tribute to the scientific achievements of Hartmut Ehrig, who passed away in March 2016. The contributions represent a selection from a symposium, held in October 2016 at TU Berlin, commemorating Hartmut' s life and work as...
  • №134
  • 18,32 МБ
  • добавлен
  • изменен
Springer International Publishing AG, part of Springer Nature, 2018. — 343 p. — (Lecture Notes in Computer Science 10800) — ISBN 331975395. This volume pays tribute to the scientific achievements of Hartmut Ehrig, who passed away in March 2016. The contributions represent a selection from a symposium, held in October 2016 at TU Berlin, commemorating Hartmut' s life and work as...
  • №135
  • 5,76 МБ
  • добавлен
  • изменен
North-Holland, 1991. — 270 p. The contributions in this volume are divided into three sections: theoretical, new models and algorithmic. The first section focuses on properties of the standard domination number (G), the second section is concerned with new variations on the domination theme, and the third is primarily concerned with finding classes of graphs for which the...
  • №136
  • 1,80 МБ
  • добавлен
  • изменен
Oxford: Oxford University Press, 2004. - 256p. This is a book about graph homomorphisms. Graph theory is now an established discipline but the study of graph homomorphisms has only recently begun to gain wide acceptance and interest. The subject gives a useful perspective in areas such as graph reconstruction, products, fractional and circular colorings, and has applications in...
  • №137
  • 5,49 МБ
  • добавлен
  • изменен
Springer Science+Business Media, New York, 2013. — 184 p. — (Springer Monographs in Mathematics) — ISBN: 1461465249 Total Domination in Graphs gives a clear understanding of this topic to any interested reader who has a modest background in graph theory. This book provides and explores the fundamentals of total domination in graphs. Some of the topics featured include the...
  • №138
  • 1,87 МБ
  • добавлен
  • изменен
O'Reilly Media, 2019. — 300 р. — (Early Release). — ISBN 978-1492047681. Discover how graph algorithms can help you leverage the relationships within your data to develop more intelligent solutions and enhance your machine learning models. You’ll learn how graph analytics are uniquely suited to unfold complex structures and reveal difficult-to-find patterns lurking in your data....
  • №139
  • 20,38 МБ
  • добавлен
  • изменен
Cambridge University Press, 1993. — 360 p. — ISBN: 0521435943, 9780521435949 The Petersen graph occupies an important position in the development of several areas of modern graph theory, because it often appears as a counter-example to important conjectures. In this account, the authors examine those areas, using the prominent role of the Petersen graph as a unifying feature....
  • №140
  • 19,16 МБ
  • добавлен
  • изменен
Mathematical Association, 2008. — 323 p. — ISBN: 0883851849, 9780883851845 This book collects the work of thirty-five instructors who share their innovations and insights about teaching discrete mathematics. Whether you teach at the college or high school level; whether your students are from mathematics, computer science, or engineering; whether you emphasize logic, proof,...
  • №141
  • 4,90 МБ
  • добавлен
  • изменен
Boca Raton, USA: CRC Press, Taylor & Francis Group, 2008. — 722 p. — ISBN 1420044818. The advancement of large scale integrated circuit technology has enabled the construction of complex interconnection networks. Graph theory provides a fundamental tool for designing and analyzing such networks. Graph Theory and Interconnection Networks provides a thorough understanding of these...
  • №142
  • 8,56 МБ
  • добавлен
  • изменен
North-Holland, 1992. — 353 p. The Steiner problem asks for a shortest network which spans a given set of points. Minimum spanning networks have been well-studied when all connections are required to be between the given points. The novelty of the Steiner tree problem is that new auxiliary points can be introduced between the original points so that a spanning network of all...
  • №143
  • 2,46 МБ
  • добавлен
  • изменен
North-Holland, 1992. — 353 p. The Steiner problem asks for a shortest network which spans a given set of points. Minimum spanning networks have been well-studied when all connections are required to be between the given points. The novelty of the Steiner tree problem is that new auxiliary points can be introduced between the original points so that a spanning network of all...
  • №144
  • 4,25 МБ
  • добавлен
  • изменен
Издательство A K Peters, 2008, -213 pp. Graphs have become a convenient, practical, and efficient tool to model real-world problems. Their increasing utilization has become commonplace in the natural and social sciences, in computer science, and in engineering. The development of large-scale communication and computer networks as well as the efforts in biology to analyze the...
  • №145
  • 1001,90 КБ
  • добавлен
  • изменен
New York: CRC Press, 2014 - 236p. How do you know what works and what doesn't? This book contains case studies highlighting the power of polytope projects for complex problem solving. Any sort of combinational problem characterized by a large variety of possibly complex constructions and deconstructions based on simple building blocks can be studied in a similar way. Although...
  • №146
  • 9,05 МБ
  • добавлен
  • изменен
Издательство John Wiley, 2000, -335 pp. The theory of random graphs originated in a series of papers published in the period 1959-1968 by two outstanding Hungarian mathematicians, Paul Erdos and Alfred Renyi. Over the forty years that have passed since then, the theory has developed into an independent and fast-growing branch of discrete mathematics, located at the intersection...
  • №147
  • 2,79 МБ
  • добавлен
  • изменен
Wiley-Interscience, 1994. — 320 p. Contains a wealth of information previously scattered in research journals, conference proceedings and technical reports. Identifies more than 200 unsolved problems. Every problem is stated in a self-contained, extremely accessible format, followed by comments on its history, related results and literature. The book will stimulate research and...
  • №148
  • 14,39 МБ
  • добавлен
  • изменен
Издательство Springer, 2008, -368 pp. This book is a revised version of my 2005 thesis for the degree of Doctor of Philosophy at the Royal Institute of Technology (KTH) in Stockholm. The whole idea of writing a monograph about graph complexes is due to Professor Anders Bjӧrner, my scientific advisor. I am deeply grateful for all his comments, remarks, and suggestions during the...
  • №149
  • 2,48 МБ
  • добавлен
  • изменен
В этой работе описывается алгоритм для приблизительного нахождения самого быстрого маршрута пути для транспортного средства, при перемещении между двумя пунктами на оцифрованной карте местности, с обходом препятствий по пути. Подход, принятый в этой работе должен решить проблему 'наименьшей стоимости пути' на графе с функцией стоимости на гранях графа. Эта работа результат...
  • №150
  • 598,94 КБ
  • дата добавления неизвестна
  • изменен
2011. — 299 p. Introduction to Graph Theory . Graphs and digraphs. Subgraphs and other graph types. Representing graphs as matrices. Isomorphic graphs. New graphs from old. Common applications. Problems. Graph Algorithms . Representing graphs in a computer. Graph searching. Weights and distances. Dijkstra's algorithm. Bellman-Ford algorithm. Floyd-Roy-Warshall...
  • №151
  • 5,01 МБ
  • добавлен
  • изменен
Basel: Birkhäuser, 2017. — 334 p. This textbook acts as a pathway to higher mathematics by seeking and illuminating the connections between graph theory and diverse fields of mathematics, such as calculus on manifolds, group theory, algebraic curves, Fourier analysis, cryptography and other areas of combinatorics. An overview of graph theory definitions and polynomial invariants...
  • №152
  • 5,13 МБ
  • добавлен
  • изменен
Springer, 2013. – 667 p. – 4th ed. – ISBN: 3642322778, 9783642322785 Series: Algorithms and Computation in Mathematics, Vol.5. From the reviews of the previous editions ". The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, and researchers in this area. The...
  • №153
  • 4,22 МБ
  • добавлен
  • изменен
Springer, 2007. - 650 pages. Combinatorial optimization, along with graph algorithms and complexity theory is booming. This book treats the most prominent problems which are polynomially solvable. The Traveling Salesman Problem is discussed as a paradigm of an NP-complete problem. The text is well written, most exercises are quite enlightening and the hints are clear....
  • №154
  • 5,24 МБ
  • дата добавления неизвестна
  • изменен
Springer, 2001. - 326 pages. Graph drawing comprises all aspects of visualizing structural relations between objects. The range of topics dealt with extends from graph theory, graph algorithms, geometry, and topology to visual languages, visual perception, and information visualization, and to computer-human interaction and graphics design. This monograph gives a systematic...
  • №155
  • 11,12 МБ
  • добавлен
  • изменен
Springer, 2001. — 2001. — 318 p. — ISBN 3540420622, 9783540420620 Graph drawing comprises all aspects of visualizing structural relations between objects. The range of topics dealt with extends from graph theory, graph algorithms, geometry, and topology to visual languages, visual perception, and information visualization, and to computer-human interaction and graphics design....
  • №156
  • 3,40 МБ
  • добавлен
  • изменен
New York: North Holland, 1988. — 415 p. It has been said that modern molecular theory is founded on essentially graph-like models located in some appropriate embedding space. The idea may be extended to physical theory, and it is this that provides the raison d'etre for this collection of papers. Today there is almost no branch of chemistry, including its more recent relatives...
  • №157
  • 20,87 МБ
  • добавлен
  • изменен
Springer, 2015. — 278 p. — (Monographs in Theoretical Computer Science. An EATCS Series). — ISBN: 978-3-319-25857-7, 978-3-319-25859-1 This is the first comprehensive introduction to the theory of word-representable graphs, a generalization of several classical classes of graphs, and a new topic in discrete mathematics. After extensive introductory chapters that explain the...
  • №158
  • 3,09 МБ
  • добавлен
  • изменен
Berlin: De Gruyter, 2011. — 308 p. This is a highly self-contained book about algebraic graph theory which iswritten with a view to keep the lively and unconventional atmosphere of a spoken text to communicate the enthusiasm the author feels about this subject. The focus is on homomorphisms and endomorphisms, matrices and eigenvalues. Graph models are extremely useful for...
  • №159
  • 1,65 МБ
  • добавлен
  • изменен
CRC Press, 2005. — 305 p. Our objective in writing this book is to present the theory of graphs from an algorithmic viewpoint. We present the graph theory in a rigorous, but informal style and cover most of the main areas of graph theory. The ideas of surface topology are presented from an intuitive point of view. We have also included a discussion on linear programming that...
  • №160
  • 7,43 МБ
  • добавлен
  • изменен
Second Edition. — Chapman and Hall/CRC, 2017. — 566 p. — (Discrete Mathematics and Its Applications). — ISBN 9781482251166. The second edition of this popular book presents the theory of graphs from an algorithmic viewpoint. The authors present the graph theory in a rigorous, but informal style and cover most of the main areas of graph theory. The ideas of surface topology are...
  • №161
  • 9,74 МБ
  • добавлен
  • изменен
2nd edition. — CRC, 2016. — 566 s. — ISBN 978-1-4822-5116-6. The second edition of this popular book presents the theory of graphs from an algorithmic viewpoint. The authors present the graph theory in a rigorous, but informal style and cover most of the main areas of graph theory. The ideas of surface topology are presented from an intuitive point of view. We have also included a...
  • №162
  • 3,36 МБ
  • добавлен
  • изменен
Singapore: World Scientific Publishing, 2015. - 493p. This book is an expansion of our first book Introduction to Graph Theory: H3 Mathematics. While the first book was intended for capable high school students and university freshmen, this version covers substantially more ground and is intended as a reference and textbook for undergraduate studies in Graph Theory. In fact,...
  • №163
  • 3,89 МБ
  • добавлен
  • изменен
World Scientific, 2007. - 245 pages. Graph theory is an area in discrete mathematics which studies configurations (called graphs) involving a set of vertices interconnected by edges. This book is intended as a general introduction to graph theory and, in particular, as a resource book for junior college students and teachers reading and teaching the subject at H3 Level in the...
  • №164
  • 3,26 МБ
  • добавлен
  • изменен
Cambridge University Press, 1998. — 264 p. — ISBN: 0521440815, 9780521440813, 0521119685, 9780521119689, 9780511721342 The book is devoted to the study of classical combinatorial structures such as random graphs, permutations, and systems of random linear equations in finite fields. The author shows how the application of the generalized scheme of allocation in the study of...
  • №165
  • 1,93 МБ
  • добавлен
  • изменен
Cambridge: Cambridge University Press, 1998. — 268 p. The book is devoted to the study of classical combinatorial structures such as random graphs, permutations, and systems of random linear equations in finite fields. The author shows how the application of the generalized scheme of allocation in the study of random graphs and permutations reduces the combinatorial problems to...
  • №166
  • 953,67 КБ
  • добавлен
  • изменен
Издательство Oxford University Press, 2011, -283 pp. This book provides an introduction to the mathematical theory of expander families. It is intended for advanced undergraduates, graduate students, and faculty. The prerequisites for this book are as follows. No graph theory is assumed; we develop it all from scratch. One course on introductory undergraduate group theory is...
  • №167
  • 1,40 МБ
  • добавлен
  • изменен
Cambridge: Cambridge University Press, 2016. — 132 p. The theory of random graphs is a vital part of the education of any researcher entering the fascinating world of combinatorics. However, due to their diverse nature, the geometric and structural aspects of the theory often remain an obscure part of the formative study of young combinatorialists and probabilists. Moreover, the...
  • №168
  • 1,03 МБ
  • добавлен
  • изменен
N.-Y.: Springer, 2015. - 253p. This book treats graph colouring as an algorithmic problem, with a strong emphasis on practical applications. The author describes and analyses some of the best-known algorithms for colouring arbitrary graphs, focusing on whether these heuristics can provide optimal solutions in some cases; how they perform on graphs where the chromatic number is...
  • №169
  • 2,49 МБ
  • добавлен
  • изменен
New York: Springer, 2018. — 144 p. A comprehensive survey of proper connection of graphs is discussed in this book with real world applications in computer science and network security. Beginning with a brief introduction, comprising relevant definitions and preliminary results, this book moves on to consider a variety of properties of graphs that imply bounds on the proper...
  • №170
  • 1,63 МБ
  • добавлен
  • изменен
New York: Springer, 2016. — 148 p. Noteworthy results, proof techniques, open problems and conjectures in generalized (edge-) connectivity are discussed in this book. Both theoretical and practical analyses for generalized (edge-) connectivity of graphs are provided. Topics covered in this book include: generalized (edge-) connectivity of graph classes, algorithms, computational...
  • №171
  • 1,53 МБ
  • добавлен
  • изменен
Springer, 2012. — 269 p. — ISBN 1461442192. This book is about graph energy. The authors have included many of the important results on graph energy, such as the complete solution to the conjecture on maximal energy of unicyclic graphs, the Wagner-Heuberger’s result on the energy of trees, the energy of random graphs or the approach to energy using singular values. It contains an...
  • №172
  • 6,51 МБ
  • добавлен
  • изменен
Singapore: World Scientific Publishing Company, 2006. - 407p. This book contains Volume 7 of the "Journal of Graph Algorithms and Applications" (JGAA). JGAA is a peer-reviewed scientific journal devoted to the publication of high-quality research papers on the analysis, design, implementation, and applications of graph algorithms. Areas of interest include computational...
  • №173
  • 10,90 МБ
  • добавлен
  • изменен
Springer – 2009, 237 pages ISBN: 3642020283, 9783642020292 Martin Charles Golumbic has been making seminal contributions to algorithmic graph theory and artificial intelligence throughout his career. He is universally admired as a long-standing pillar of the discipline of computer science. He has contributed to the development of fundamental research in artificial intelligence...
  • №174
  • 2,86 МБ
  • добавлен
  • изменен
Издательство Springer, 2000, -316 pp. Combinatorics and Matrix Theory have a symbiotic, or mutually beneficial, relationship. This relationship is discussed in my paper The symbiotic relationship of combinatorics and matrix theory where I attempted to justify this description. One could say that a more detailed justification was given in my book with H.J. Ryser entitled...
  • №175
  • 3,69 МБ
  • добавлен
  • изменен
The Mathematical Association of America, 2008. - 220 Pages. ISBN: 0883857537 Graph Theory presents a natural, reader-friendly way to learn some of the essential ideas of graph theory starting from first principles. The format is similar to the companion text, Combinatorics: A Problem Oriented Approach also by Daniel A. Marcus, in that it combines the features of a textbook with...
  • №176
  • 3,94 МБ
  • добавлен
  • изменен
The Mathematical Association of America; Later Printing edition, 1999. — 143 p. — (Classroom Resource Materials). — ISBN: 0883857103, 9780883857106 The format of this book is unique in that it combines features of a traditional text with those of a problem book. The material is presented through a series of problems, about 250 in all, with connecting text; this is supplemented...
  • №177
  • 1,79 МБ
  • добавлен
  • изменен
Springer Science, 2013. — 198 p. — 2nd ed. — ISBN: 0817683909, 9780817683900. e-ISBN 9780817683917. Magic squares are among the more popular mathematical recreations. Over the last 50 years, many generalizations of magic ideas have been applied to graphs. Recently there has been a resurgence of interest in magic labelings due to a number of results that have applications to the...
  • №178
  • 3,78 МБ
  • добавлен
  • изменен
New York: Springer, 2018. — 326 p. This book provides a timely overview of fuzzy graph theory, laying the foundation for future applications in a broad range of areas. It introduces readers to fundamental theories, such as Craine’s work on fuzzy interval graphs, fuzzy analogs of Marczewski’s theorem, and the Gilmore and Hoffman characterization. It also introduces them to the...
  • №179
  • 7,26 МБ
  • добавлен
  • изменен
It is not a beginner or advanced tutorial, not a study of graphs, it’s only a gallery of undirected graphs made with the package tkz-berge.sty v2.7b. Some of graphs have names, sometimes inspired by the graph’s topology, and sometimes after their discoverer. A lot of references can be found here http:// mathworld.wolfram.com Andrasfai graph Balaban graph Complete BiPartite...
  • №180
  • 590,51 КБ
  • добавлен
  • изменен
Society for Industrial and Applied Mathematics, 1999, -214 pp. Intersection graphs provide theory to underlie much of graph theory. They epitomize graph-theoretic structure and have their own distinctive concepts and emphasis. They subsume concepts as standard as line graphs and as nonstandard as tolerance graphs. They have real applications to topics like biology, computing,...
  • №181
  • 1,25 МБ
  • добавлен
  • изменен
Paper. Journal of the ACM, Vol. 44, No. 4, July 1997, pp. 585–591. We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implement, and has a surprisingly simple proof of correctness. Its runtime matches that of the fastest algorithm known. The runtime analysis...
  • №182
  • 202,97 КБ
  • добавлен
  • изменен
Springer, 2013 — 216 p. Series: Studies in Computational Intelligence In the last decade we have seen the emergence of a new inter-disciplinary field concentrating on the understanding large networks which are dynamic, large, open, and have a structure that borders order and randomness. The field of Complex Networks has helped us better understand many complex phenomena such...
  • №183
  • 19,30 МБ
  • добавлен
  • изменен
Wiley-Interscience, 2000. - 256 pages. A lively invitation to the flavor, elegance, and power of graph theory. This mathematically rigorous introduction is tempered and enlivened by numerous illustrations, revealing examples, seductive applications, and historical references. An award-winning teacher, Russ Merris has crafted a book designed to attract and engage through its...
  • №184
  • 6,86 МБ
  • добавлен
  • изменен
Издательство Princeton University Press, 2010, -424 pp. The emergence of (relatively) cheap sensing and actuation nodes, capable of short-range communications and local decision-making, has raised a number of new system-level questions concerning how such systems should be coordinated and controlled. Arguably, the biggest challenge facing this new field of research is means by...
  • №185
  • 3,94 МБ
  • добавлен
  • изменен
Издательство Johns Hopkins University Press, 2001, -299 pp. Graphs on surfaces form a natural link between discrete and continuous mathematics. They enable us to understand both graphs and surfaces better. It would be difficult to prove the celebrated classification theorem for (compact) surfaces without the use of graphs. Map color problems are usually formulated and solved as...
  • №186
  • 3,02 МБ
  • добавлен
  • изменен
Boca Raton: CRC Press, 2012. - 425p. On the surface, matrix theory and graph theory seem like very different branches of mathematics. However, adjacency, Laplacian, and incidence matrices are commonly used to represent graphs, and many properties of matrices can give us useful information about the structure of graphs. Applications of Combinatorial Matrix Theory to Laplacian...
  • №187
  • 4,12 МБ
  • добавлен
  • изменен
Springer, 2001. - 326 pages. Over the past decade, many major advances have been made in the field of graph coloring via the probabilistic method. This monograph, by two of the best on the topic, provides an accessible and unified treatment of these results, using tools such as the Lovasz Local Lemma and Talagrand's concentration inequality. From the reviews of the first...
  • №188
  • 24,39 МБ
  • добавлен
  • изменен
Springer, 2002. — 341 p. — ISBN: 3540421394, 9783540421399 Over the past decade, many major advances have been made in the field of graph colouring via the probabilistic method. This monograph provides an accessible and unified treatment of these results, using tools such as the Lovasz Local Lemma and Talagrand's concentration inequality. The topics covered include: Kahn's...
  • №189
  • 2,29 МБ
  • добавлен
  • изменен
Corr. ed. (Project Gutenberg, 2013) — New York: Holt, Rinehart and Winston, 1968. — 142 p. Tournaments, in this context, are directed graphs―an important and interesting topic in graph theory. This concise volume collects a substantial amount of information on tournaments from throughout the mathematical literature. Suitable for advanced undergraduate students of mathematics, the...
  • №190
  • 1,05 МБ
  • добавлен
  • изменен
Springer, 2019. — 220 p. — ( Studies in Fuzziness and Soft Computing 375). — ISBN 3030042146. This book builds on two recently published books by the same authors on fuzzy graph theory. Continuing in their tradition, it provides readers with an extensive set of tools for applying fuzzy mathematics and graph theory to social problems such as human trafficking and illegal...
  • №191
  • 4,04 МБ
  • добавлен
  • изменен
Springer International Publishing AG, 2018. — 262 p. — (Studies in Fuzziness and Soft Computing 365). — ISBN 978-3-319-76453-5. This book reports on advanced concepts in fuzzy graph theory, showing a set of tools that can be successfully applied to understanding and modeling illegal human trafficking. Building on the previous book on fuzzy graph by the same authors, which set the...
  • №192
  • 3,51 МБ
  • добавлен
  • изменен
New York: Springer, 2018. — 257 p. This book reports on advanced concepts in fuzzy graph theory, showing a set of tools that can be successfully applied to understanding and modeling illegal human trafficking. Building on the previous book on fuzzy graph by the same authors, which set the fundamentals for readers to understand this developing field of research, this second book...
  • №193
  • 2,44 МБ
  • добавлен
  • изменен
Thrissur (India): Vidya Academy of Science & Technology, 2017. — 176 p. Graph theory is a well-known area of Discrete Mathematics which has so many theoretical developments and applications not only to different branches of Mathematics, but also to various other fields of basic sciences, technology, social sciences and computer science. Graphs are widely used as efficient and...
  • №194
  • 3,18 МБ
  • добавлен
  • изменен
Cambridge University Press, 2008. — 392 p. — ISBN: 9780521878647, 0521878640 Algorithmic Aspects of Graph Connectivity is the first comprehensive book on this central notion in graph and network theory, emphasizing its algorithmic aspects. Because of its wide applications in the fields of communication, transportation, and production, graph connectivity has made tremendous...
  • №195
  • 3,99 МБ
  • добавлен
  • изменен
Paris: European Mathematical Society, 2018. — 167 p. Spectral graph theory starts by associating matrices to graphs – notably, the adjacency matrix and the Laplacian matrix. The general theme is then, firstly, to compute or estimate the eigenvalues of such matrices, and secondly, to relate the eigenvalues to structural properties of graphs. As it turns out, the spectral...
  • №196
  • 1,09 МБ
  • добавлен
  • изменен
Издательство North Holland, 1988, -244 pp. The theory of planar graphs was first discovered in 1736 by Euler when he found his important formula relating the numbers of vertices, edges and faces of polyhedrons, which can be represented by planar graphs. Since that time numerous results have been obtained on planar graphs. One of the most outstanding results is Kuratowski's...
  • №197
  • 1,75 МБ
  • добавлен
  • изменен
Издательство Cambridge University Press, 1999, -187 pp. This research monograph is concerned with two dual structures in graphs. These structures, one based on the concept of a circuit and the other on the concept of a cutset are strongly interdependent and constitute a hybrid structure called a graphoid. This approach to graph theory dealing with graphoidal structures we call...
  • №198
  • 1,20 МБ
  • добавлен
  • изменен
The Mathematical Association of America, 1996, -158 pp. This book is one of a series written by professional mathematicians in order to make some important mathematical ideas interesting and understandable to a large audience of high school students and laymen. Most of the volumes in the New Mathematical Library cover topics not usually included in the high school curriculum;...
  • №199
  • 1,07 МБ
  • добавлен
  • изменен
Washington D.C.: The Mathematical Association of America, 1996. — 158 p. — (New Mathematical Library 34). — ISBN 978-0883856352. This book is one of a series written by professional mathematicians in order to make some important mathematical ideas interesting and understandable to a large audience of high school students and laymen. Most of the volumes in the New Mathematical...
  • №200
  • 6,26 МБ
  • добавлен
  • изменен
279 c. 1962 г. Fundamental concepts Connectedness Path problems Trees Leaves and lobes The axiom of choice Matching theorems Directed graphs Acyclic graphs Partial order Binary relations and Galois correspondences Connecting paths Dominating sets, covering sets, and independent sets Chromatic graphs Groups and graphs
  • №201
  • 1,63 МБ
  • дата добавления неизвестна
  • изменен
Издательство Springer, 2011, -302 pp. This book is an introductory text in graph theory, focusing on partial cubes, that is, graphs that are isometrically embeddable into hypercubes of an arbitrary dimension. This branch of graph theory has developed rapidly during the past three decades, producing exciting results and establishing links to other branches of mathematics....
  • №202
  • 7,22 МБ
  • добавлен
  • изменен
Springer, 2013. — 611 p. — (Algorithms and combinatorics). — ISBN: 9781461401100, 1461401100 In many applications of graph theory, graphs are regarded as geometric objects drawn in the plane or in some other surface. The traditional methods of ""abstract"" graph theory are often incapable of providing satisfactory answers to questions arising in such applications. In the past...
  • №203
  • 5,17 МБ
  • добавлен
  • изменен
Oxford University Press, 2003. — 348 p. — ISBN: 0198506260, 9780198506263. This monograph sets out a body of mathematical theory for finite graphs with nodes placed randomly in Euclidean space and edges added to connect points that are close to each other. As an alternative to classical random graph models, these geometric graphs are relevant to the modelling of real-world...
  • №204
  • 5,72 МБ
  • добавлен
  • изменен
Springer, 1993. — 576 p. In a declarative programming language a computation is expressed in a static fashion, as a list of declarations. A program in such a language is regarded as a specification that happens to be executable as well. In this textbook we focus on a subclass of the declarative languages, the functional programming languages, sometimes called applicative...
  • №205
  • 1,47 МБ
  • добавлен
  • изменен
Springer, 2012. — 450 p. — (Lecture Notes in Mathematics 2039). — ISBN 3642238394. Small-radius tubular structures have attracted considerable attention in the last few years, and are frequently used in different areas such as Mathematical Physics, Spectral Geometry and Global Analysis. In this monograph, we analyse Laplace-like operators on thin tubular structures ("graph-like...
  • №206
  • 2,37 МБ
  • добавлен
  • изменен
Oxford University Press, 2014. — 298 p. — ISBN: 0199996725, 9780199996728 An Introduction to Grids, Graphs, and Networks aims to provide a concise introduction to graphs and networks at a level that is accessible to scientists, engineers, and students. In a practical approach, the book presents only the necessary theoretical concepts from mathematics and considers a variety of...
  • №207
  • 4,88 МБ
  • добавлен
  • изменен
Vieweg, 2002. — 251 p. "A very simple but instructive problem was treated by Jacob Steiner, the famous representative of geometry at the University of Berlin in the early nineteenth century. Three villages A,B ,C are to be joined by a system of roads of minimum length." Due to this remark of Courant and Robbins (1941), a problem received its name that actually reaches two...
  • №208
  • 7,23 МБ
  • добавлен
  • изменен
New York: School of Mathematics, Statistics and Applied Mathematics, 2017. — 42 p. Matrices and Graphs The Adjacency Matrix Some matrix background Real Symmetric Matrices Special properties of real symmetric matrices Diagonalizability of symmetric matrices Connections to the adjacency spectrum The Laplacian Matrix of a Graph Introduction to the graph Laplacian Spanning Trees...
  • №209
  • 295,44 КБ
  • добавлен
  • изменен
Springer, 2013. – 229 p. – ISBN: 8132207491, 9788132207504 The book has many important features which make it suitable for both undergraduate and postgraduate students in various branches of engineering and general and applied sciences. The important topics interrelating Mathematics & Computer Science are also covered briefly. The book is useful to readers with a wide range of...
  • №210
  • 3,19 МБ
  • добавлен
  • изменен
Издательство Marcel Dekker, 1993, -322 pp. It is customary in mathematics to show one's love and respect for a senior colleague by dedicating a research paper to him or herbirthdays and special anniversaries are two usual occasions. This is a book containing 21 such research papers in honor of the sixtieth birthday of Professor Norman J. Pullman on March 31, 1991. Professor...
  • №211
  • 2,63 МБ
  • добавлен
  • изменен
Springer-Verlag Berlin Heidelberg, 2009. — 151 p. — (Lecture Notes in Physics 766). — ISBN: 978-3-540-87833-9 (eBook), 978-3-642-09965-6 (Softcover), 978-3-540-87832-2 (Hardcover). In the modern world of gigantic datasets, which scientists and practioners of all fields of learning are confronted with, the availability of robust, scalable and easy-to-use methods for pattern...
  • №212
  • 3,79 МБ
  • добавлен
  • изменен
Springer International Publishing AG, 2017. — 473 p. — (A Series of Modern Surveys in Mathematics 66) — ISBN 978-3-319-61041-2. This book offers a detailed introduction to graph theoretic methods in profinite groups and applications to abstract groups. It is the first to provide a comprehensive treatment of the subject. The author begins by carefully developing relevant notions in...
  • №213
  • 4,51 МБ
  • добавлен
  • изменен
World Scientific, 2010. — 346 p. Due to the ability of graphs to represent properties of entities and binary relations at the same time, a growing interest in graph based object repre- sentation can be observed in science and engineering. Yet, graphs are still not the common data structure in pattern recognition and related ¯elds. The reason for this is twofold. First, working...
  • №214
  • 10,09 МБ
  • добавлен
  • изменен
ISTE Ltd and John Wiley & Sons, Inc, 2016. — 281 p. — ISBN: 1848216165 Advanced Graph Theory focuses on some of the main notions arising in graph theory with an emphasis from the very start of the book on the possible applications of the theory and the fruitful links existing with linear algebra. The second part of the book covers basic material related to linear recurrence...
  • №215
  • 3,23 МБ
  • добавлен
  • изменен
SIAM, 1978. — 133. This book is intended as a survey of applications of graph theory, and as such the writer highlights what is important without going into too much technical detail. The writing style is readable and exceedingly well-motivated. The book is quite short; it's not a Giant Tome of Information. It's designed for readability, and any additional detail you require...
  • №216
  • 1,07 МБ
  • добавлен
  • изменен
SIAM, 1978. — 133. This book is intended as a survey of applications of graph theory, and as such the writer highlights what is important without going into too much technical detail. The writing style is readable and exceedingly well-motivated. The book is quite short; it's not a Giant Tome of Information. It's designed for readability, and any additional detail you require...
  • №217
  • 6,20 МБ
  • добавлен
  • изменен
Издательство Kluwer, 2002, -270 pp. Theoretical computer science is a mathematical discipline that often abstracts its problems from the (hardware and software) technology of "real" computer science. When these problems are solved, the results obtained often appear in journals dedicated to the motivating technology rather than in a "general-purpose" Theory journal. Since the...
  • №218
  • 3,12 МБ
  • добавлен
  • изменен
World Scientific, 1997. — 570 p. Graph grammars originated in the late 60s, motivated by considerations about pattern recognition and compiler construction. Since then the list of areas which have interacted with the development of graph grammars has grown quite impressively. Besides the aforementioned areas it includes software specification and development, VLSI layout schemes,...
  • №219
  • 25,82 МБ
  • добавлен
  • изменен
Tampere University of Technology, 2006, -115 pp. These lecture notes were translated from the Finnish lecture notes for the TUT course Graafiteoria. The laborious bulk translation was taken care of by the students Janne Tamminen (TUT) and Kung-Chung Lee (visiting from the University of British Columbia). Most of the material was then checked by professor Robert Piché. I want to...
  • №220
  • 612,70 КБ
  • добавлен
  • изменен
Springer, 2017. — 169 p. This undergraduate textbook provides an introduction to graph theory, which has numerous applications in modeling problems in science and technology, and has become a vital component to computer science, computer science and engineering, and mathematics curricula of universities all over the world. The author follows a methodical and easy to understand...
  • №221
  • 6,51 МБ
  • добавлен
  • изменен
New York: Chapman and Hall/CRC, 2016. — 353 p. The tool for visualization is Microsoft Visual C++. This popular software has the standard C++ combined with the Microsoft Foundation Classes (MFC) libraries for Windows visualization. This book explains how to create a graph interactively, solve problems in graph theory with minimum number of C++ codes, and provide friendly...
  • №222
  • 10,54 МБ
  • добавлен
  • изменен
Boca Raton, USA: CRC Press, Taylor & Francis Group, 2016. — 353 p. — ISBN 149872101X. The tool for visualization is Microsoft Visual C++. This popular software has the standard C++ combined with the Microsoft Foundation Classes (MFC) libraries for Windows visualization. This book explains how to create a graph interactively, solve problems in graph theory with minimum number of...
  • №223
  • 12,96 МБ
  • добавлен
  • изменен
CRC Press, 2013. — 472 p. — ISBN: 1439873100, 9781439873106 Near Rings, Fuzzy Ideals, and Graph Theory explores the relationship between near rings and fuzzy sets and between near rings and graph theory. It covers topics from recent literature along with several characterizations. After introducing all of the necessary fundamentals of algebraic systems, the book presents the...
  • №224
  • 8,26 МБ
  • добавлен
  • изменен
Leipzig: Teubner, 1988. - 152p. This book gives a survey on the main results concerning the subject described by the title, also considering the contributions made by the authors in this field* The central object is to study the dependence of the Hamiltonian behaviour of given products of graphs on properties of the factors. Moreover, the classical products (Cartesian sum,...
  • №225
  • 5,84 МБ
  • добавлен
  • изменен
Teubner, 1988. — 152. This book aims to offer a survey of the most important results and ideas concerning the field of the Hamiltonian properties of products of undirected and directed graphs* We understand by Hamiltonian properties - in the sense of a collective denotation - such properties of graphs being related to the existence of Hamiltonian paths or Hamiltonian cycles in...
  • №226
  • 1,92 МБ
  • добавлен
  • изменен
Boca Raton: CRC Press, 2018. — 353 p. Aimed at graduate students and professionals in both mathematics and computer science The first book of its kind devoted to the topic Authored by a noted authority in crossing numbers Crossing Numbers of Graphs is the first book devoted to the crossing number, an increasingly popular object of study with surprising connections. The field has...
  • №227
  • 3,66 МБ
  • добавлен
  • изменен
Издательство John Wiley, 1997, -230 pp. Graph theory is one of the branches of modem mathematics having experienced a most impressive development in recent years. In the beginning, Graph Theory was only a collection of recreational or challenging problems like Euler tours or the four coloring of a map, with no clear connection among them, or among techniques used to attach...
  • №228
  • 1,75 МБ
  • добавлен
  • изменен
London: Imperial College Press, 2012. - 428p. This pioneering book presents a study of the interrelationships among operator calculus, graph theory, and quantum probability in a unified manner, with significant emphasis on symbolic computations and an eye toward applications in computer science. Presented in this book are new methods, built on the algebraic framework of...
  • №229
  • 3,19 МБ
  • добавлен
  • изменен
Addison-Wesley, 1961. — 329. This text has grown out of a graduate course entitled "Foundations of Electric Network Theory," organized at the University of Illinois by the second author in 1949. Such a course has since been taught by the two authors regularly at Illinois, Syracuse, and Michigan State Universities. Over the period of years, the material has naturally evolved...
  • №230
  • 3,90 МБ
  • добавлен
  • изменен
CRC Press, 2017. — 262 p. — (Discrete Mathematics Its Applications). — ISBN 1498755909. This book covers both theoretical and practical results for graph polynomials. Graph polynomials have been developed for measuring combinatorial graph invariants and for characterizing graphs. Various problems in pure and applied graph theory or discrete mathematics can be treated and solved...
  • №231
  • 7,16 МБ
  • добавлен
  • изменен
Singapore: World Scientific, 2016. - 270 p. This book shows how the ADE Coxeter graphs unify at least 20 different types of mathematical structures. These mathematical structures are of great utility in unified field theory, string theory, and other areas of physics.
  • №232
  • 5,71 МБ
  • добавлен
  • изменен
AT&T Bell Laboratories, Murray Hill, NJ 35 pages Abstract Introduction Splay Trees Update Operations on Splay Trees Implementations of Splaying and Its Variants Two Applications of Splaying Remarks and Open Problems
  • №233
  • 2,34 МБ
  • добавлен
  • изменен
Woodhead Publishing, 2003. — 204 p. — ISBN: 1898563918, 9781898563914 Dr Smith here presents essential mathematical and computational ideas of network optimization for senior undergraduate and postgraduate students in mathematics, computer science and operational research. He shows how algorithms can be used for finding optimal paths and flows, identifying trees in networks,...
  • №234
  • 18,78 МБ
  • добавлен
  • изменен
245 pages. It seems to me that it may be the appropriate time to submit my book, with tentative title Efficient Graph Representations, to a publisher. It is not completely polished at this point, but to polish it up before getting comments from referees which might change substantial sections of the book seems a bit misguided. The final version of this book may be individually...
  • №235
  • 1,06 МБ
  • дата добавления неизвестна
  • изменен
Cambridge: Cambridge University Press, 2015. - 312p. Written for mathematicians working with the theory of graph spectra, this book explores more than 400 inequalities for eigenvalues of the six matrices associated with finite simple graphs: the adjacency matrix, Laplacian matrix, signless Laplacian matrix, normalized Laplacian matrix, Seidel matrix, and distance matrix. The...
  • №236
  • 1,71 МБ
  • добавлен
  • изменен
Berlin: De Gruyter, 2017. - 251 p. This book presents relevant results regarding the spectra of regular graphs, including classical and recent developments. It covers their basic properties, considers specific subclasses of regular graphs (like distance-regular graphs, strongly regular graphs, various designs or expanders), deals with determining particular regular graphs, and...
  • №237
  • 1,69 МБ
  • добавлен
  • изменен
Berlin: De Gruyter, 2017. — 251 p. This book presents relevant results regarding the spectra of regular graphs, including classical and recent developments. It covers their basic properties, considers specific subclasses of regular graphs (like distance-regular graphs, strongly regular graphs, various designs or expanders), deals with determining particular regular graphs, and...
  • №238
  • 1,60 МБ
  • добавлен
  • изменен
John Wiley, 2012. — 339 p. The Edge Color Problem (ECP) is to find the chromatic index χ'{G) of a given graph G, that is, the minimum number of colors needed to color the edges of G such that no two adjacent edges receive the same color. Edge coloring dates back to Peter Guthrie Tait's attempts around 1880 to prove the Four-Color Theorem. Tait observed that coloring the...
  • №239
  • 12,48 МБ
  • добавлен
  • изменен
AT&T Labs Research, Florham Park, New Jersey 33 pages Introduction Preliminaries Avoiding the Sorting Bottleneck The Component Hierarchy Visiting Minimal Vertices Towards a Linear Time Algorithm The Component Tree The Unvisited Data Structure Conclusion
  • №240
  • 232,60 КБ
  • добавлен
  • изменен
2nd ed. — Dover Publications, 1994. — 234 p. — ISBN-13: 978-0-486-67870-2. A stimulating excursion into pure mathematics aimed at "the mathematically traumatized," but great fun for mathematical hobbyists and serious mathematicians as well. Requiring only high school algebra as mathematical background, the book leads the reader from simple graphs through planar graphs, Euler's...
  • №241
  • 8,25 МБ
  • добавлен
  • изменен
2nd ed. — Dover Publications, 1994. — 234 p. — ISBN-13: 978-0-486-67870-2. A stimulating excursion into pure mathematics aimed at "the mathematically traumatized," but great fun for mathematical hobbyists and serious mathematicians as well. Requiring only high school algebra as mathematical background, the book leads the reader from simple graphs through planar graphs, Euler's...
  • №242
  • 4,27 МБ
  • добавлен
  • изменен
2nd ed. — Dover Publications, 1994. — 234 p. A stimulating excursion into pure mathematics aimed at "the mathematically traumatized," but great fun for mathematical hobbyists and serious mathematicians as well. Requiring only high school algebra as mathematical background, the book leads the reader from simple graphs through planar graphs, Euler's formula, Platonic graphs,...
  • №243
  • 6,08 МБ
  • добавлен
  • изменен
Oxford: Oxford University Press, 1998. - 86p. William Tutte, one of the founders of modern graph theory, provides a unique and personal introduction to the field. Instead of a typical survey, the author looks back at the areas which interested him most, discussing why he pursued certain problems and how he and his colleagues solved them. The book's extensive references make it...
  • №244
  • 2,76 МБ
  • добавлен
  • изменен
Springer, 2002. — 491 p. — ISBN 9783642078095. Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, such as approximation, combinatorial optimization, graphics, and operations research, graph algorithms have recently attracted increased attention from computational molecular biology and computational chemistry....
  • №245
  • 16,03 МБ
  • добавлен
  • изменен
New York: Springer, 2010. — 489 p. Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, such as approximation, combinatorial optimization, graphics, and operations research, graph algorithms have recently attracted increased attention from computational molecular biology and computational chemistry. Centered...
  • №246
  • 4,47 МБ
  • добавлен
  • изменен
Presentation. — Dublin, 2009. — 110 p. What we will cover in this course: Basic theory about graphs. Connectivity. Paths. Trees. Networks and flows. Eulerian and Hamiltonian graphs. Coloring problems. Complexity issues. A number of applications (in large graphs): Large scale problems in graphs. Similarity of nodes in large graphs. Telephony problems and...
  • №247
  • 5,85 МБ
  • добавлен
  • изменен
Cambridge University Press, 2011. — 364 p. During the first years of the third millennium, considerable interest arose in complex networks such as the Internet, the world wide web, biological networks, utility infrastructures (for transport of energy, waste, water, trains, cars and aircrafts), social networks, human brain networks, and so on. It was realized that complex...
  • №248
  • 2,60 МБ
  • добавлен
  • изменен
Maarten van Steen, 2010. - 300 pages. Maarten van Steen is full professor at the Computer Science department of VU University Amsterdam, The Netherlands. He mainly teaches in the field of distributed systems, computer networks, and operating systems. Together with Andrew Tanenbaum he has co-authored a well-known textbook on distributed systems. Confronted with the difficulties...
  • №249
  • 5,02 МБ
  • добавлен
  • изменен
New Delhi: New Age International Pvt Ltd Publishers, 2006. - 487p. This text has been carefully designed for flexible use. It is primarily designed to provide an introduction to some fundamental concepts in Graph Theory, for under-graduate and post-graduate students.
  • №250
  • 4,93 МБ
  • добавлен
  • изменен
Nova Science Publishers, 2009. - 144 pages. Graph Theory is an important area of contemporary mathematics with many applications in computer science, genetics, chemistry, engineering, industry, business and in social sciences. It is a young science invented and developing for solving challenging problems of 'computerised' society for which traditional areas of mathematics such...
  • №251
  • 1,46 МБ
  • добавлен
  • изменен
Издательство Springer, 2010, -233 pp. Learning an internal spatial model of an initially unknown environment is considered to be one of the fundamental capabilities for an autonomous spatial agent. It is noticeable that—in contrast to what is known about mental spatial representations of humans—most map learning approaches in robotics employ sensor-near representation formats...
  • №252
  • 2,31 МБ
  • добавлен
  • изменен
Издательство Birkhäuser, 2007, -272 pp. Many colleges and universities provide a first course in graph theory at about the senior level, intended primarily for mathematics majors but accessible to other students. This book is intended as a text for such a course, which I have given many times. Over the years my classes have included mainly mathematics and computer science...
  • №253
  • 3,01 МБ
  • добавлен
  • изменен
2nd ed. — Boston: Birkhäuser, 2007. — 282 p. Concisely written, gentle introduction to graph theory suitable as a textbook or for self-study Graph-theoretic applications from diverse fields (computer science, engineering, chemistry, management science). includes new chapters on labeling and communications networks and small worlds, as well as expanded beginner's material Many...
  • №254
  • 3,01 МБ
  • добавлен
  • изменен
Springer Science+Business Media, 2001. — 154 p. — ISBN: 0817642528 Magic squares, their origins lost in antiquity, are among the more popular mathematical recreations. "Magic" ideas have also been applied to graphs, labellings, and trees. Unlike many elusive subjects in this area, the problem for vertex-magic total labelings has been solved, and the details are examined in this...
  • №255
  • 3,72 МБ
  • добавлен
  • изменен
Издательство Springer, 1976, -250 pp. . In this volume we give an exposition of some results and introduce some notions which were encountered during attempts to find a good method of graph identification. . Sections of this volume are based mostly on unpublished papers of different people. I ask the reader who wishes to refer to papers constituting this volume to refer to them...
  • №256
  • 1,39 МБ
  • добавлен
  • изменен
Pearson Education (Singapore), 2000. - 609 pages. 2nd Edition. This book fills a need for a thorough introduction to graph theory that features both the understanding and writing of proofs about graphs. Verification that algorithms work is emphasized more than their complexity. An effective use of examples, and huge number of interesting exercises, demonstrate the topics of...
  • №257
  • 6,91 МБ
  • добавлен
  • изменен
Издательство Pearson Education, 2001, -871 pp. Graph theory is а delightful playground for the exploration of proof techniques in discrete mathematics, and its results have applications in many areas of the computing, social, and natural sciences. The design of this book permits usage in а one-semester introduction at the undergraduate or beginning graduate level, or in а...
  • №258
  • 17,15 МБ
  • добавлен
  • изменен
Mathematics Department University of Illinois, 2005. — 520 p. Решебник к /file/1097419/ This is the Summer 2005 version of the Instructor's Solution Manual for Introduction to Graph Theory , by Douglas B. West. Afew solutions have been added or clari fied since last year's version. Also present is a (slightly edited) annotated syllabus for the one­ semester course taught from this...
  • №259
  • 3,35 МБ
  • добавлен
  • изменен
Издательство Oxford University Press, 2002, -147 pp. This book arose out of a third-year module in graph theory given at the University of Birmingham over the three years 1996-9, and again in 2001. This module was designed to be accessible to a large number of students (the prerequisites are minimal), but still to present some challenging material. The course centres around the...
  • №260
  • 628,85 КБ
  • добавлен
  • изменен
4th Edition. — Addison Wesley, 1996. — 184 p. — ISBN 0582249937. Provides a basic foundation on trees, algorithms, Eulerian and Hamilton graphs, planar graphs and coloring, with special reference to four color theorem. Discusses directed graphs and transversal theory and related these areas to Markov chains and network flows.
  • №261
  • 13,09 МБ
  • дата добавления неизвестна
  • изменен
5th edition. — Harlow: Pears, 2010. — 193 p. Description: In recent years graph theory has emerged as a subject in its own right, as well as being an important mathematical tool in such diverse subjects as operational research, chemistry, sociology and genetics. Robin Wilson’s book has been widely used as a text for undergraduate courses in mathematics, computer science and...
  • №262
  • 24,45 МБ
  • добавлен
  • изменен
Cobenhavn: University of Copenhagen, 2009. - 89 p. Contents: Graph Coloring 1 Fibonacci Identities and Graph Colorings Introduction Identities Further Exploration Algebraic Characterization of Uniquely Vertex Colorable Graphs Introduction Algebraic Preliminaries Characterization of Vertex Colorability Characterization of Unique Vertex Colorability Algorithms for Testing (Unique)...
  • №263
  • 906,76 КБ
  • добавлен
  • изменен
Издательство Cambridge University Press, 2000, -347 pp. "Random walks" is a topic situated somewhere in between probability, potential theory, harmonic analysis, geometry, graph theory, and algebra. The beauty of the subject stems from this linkage, both in the way of thinking and in the methods employed, of different fields. Let me briefly declare what - in my viewpoint -...
  • №264
  • 2,53 МБ
  • добавлен
  • изменен
Издательство CRC Press, 2004, -193 pp. The research on spanning trees has been one of the most important areas in algorithm design. People who are interested in algorithms will find this book informative and inspiring. The new results are still accumulating, and we try to make clear the whole picture of the current status and future developments. This book is written for...
  • №265
  • 1,30 МБ
  • добавлен
  • изменен
Издательство Springer, 2003, -343 pp. In the spectrum of mathematics, graph theory which studies a mathematical structure on a set of elements with a binary relation, as a recognized discipline, is a relative newcomer. In recent three decades the exciting and rapidly growing area of the subject abounds with new mathematical developments and significant applications to...
  • №266
  • 4,80 МБ
  • добавлен
  • изменен
Springer, 2003. — 352 p. — ISBN: 1402075405, 9781402075407 This book considers a graph as a mathematical structure on a set of elements with a binary relation, and provides the most classical and important theory and application of graphs. It covers basic concepts, trees and graphic spaces, plane graphs and planar graphs, flows and connectivity, matchings and independent sets,...
  • №267
  • 9,50 МБ
  • добавлен
  • изменен
Berlin: Springer, 2015. - 74p. This is the first book to focus on the topological index, the Harary index, of a graph, including its mathematical properties, chemical applications and some related and attractive open problems. This book is dedicated to Professor Frank Harary (1921—2005), the grandmaster of graph theory and its applications. It has be written by experts in the...
  • №268
  • 3,56 МБ
  • добавлен
  • изменен
New York: Springer, 2017. — 90 p. There has been a surging interest in developing systems for analyzing big graphs generated by real applications, such as online social networks and knowledge graphs. This book aims to help readers get familiar with the computation models of various graph processing systems with minimal time investment. This book is organized into three parts,...
  • №269
  • 847,41 КБ
  • добавлен
  • изменен
Издательство Springer, 1996, -142 pp. I started writing this book in 1990 and completed the first draft in October 1991. It then took me another one and a half years (June 1992 to December 1993) to revise the first draft. My objective in writing this book is to give an up-to-date account of total colourings of graphs which can be used as a graph theory course/seminar materials...
  • №270
  • 850,93 КБ
  • добавлен
  • изменен
Higher Education Press, Beijing and Springer-Verlag, Berlin, 2009, 353 p., ISBN 978-3-540-93951-1. This book deals with two important branches of graph theory – factor theory and extendable graphs. Due to the mature techniques and wide ranges of applications, factors and matchings become useful tools in investigation of many theoretical problems and practical issues. This book...
  • №271
  • 6,84 МБ
  • добавлен
  • изменен
New York: Springer, 2016. - 239 p. This book presents versatile, modern and creative applications of graph theory in mechanical engineering, robotics and computer networks. Topics related to mechanical engineering include e.g. machine and mechanism science, mechatronics, robotics, gearing and transmissions, design theory and production processes. The graphs treated are simple...
  • №272
  • 2,76 МБ
  • добавлен
  • изменен
Cambridge University Press, 2012. — 375 p. — ISBN: 0521017564, 9780521282352 The famous Circuit Double Cover conjecture (and its numerous variants) is considered one of the major open problems in graph theory owing to its close relationship with topological graph theory, integer flow theory, graph coloring and the structure of snarks. It is easy to state: every 2-connected...
  • №273
  • 3,03 МБ
  • добавлен
  • изменен
New York: Springer, 2016. — 160 p. This book describes kaleidoscopic topics that have developed in the area of graph colorings. Unifying current material on graph coloring, this book describes current information on vertex and edge colorings in graph theory, including harmonious colorings, majestic colorings, kaleidoscopic colorings and binomial colorings. Recently there have been...
  • №274
  • 5,30 МБ
  • добавлен
  • изменен
InTech, 2012. - 525 pages. The purpose of this book is not only to present the latest state and development tendencies of graph theory, but to bring the reader far enough along the way to enable him to embark on the research problems of his own. The book is intended for both graduate and postgraduate students in fields such as mathematics, computer science, system sciences,...
  • №275
  • 20,98 МБ
  • добавлен
  • изменен
2-е издание: Учеб. пособие. – Саратов: Изд-во «Научная книга», 2009. – 76 с. ISBN 978-5-9758-0905-6 Настоящее учебное пособие содержит теоретический материал и практические задания к курсу «Введение в теорию графов», читаемому в Саратовском государственном университете. Для студентов и преподавателей математических факультетов университетов и технических вузов. Теория...
  • №276
  • 1,77 МБ
  • добавлен
  • изменен
Пер. с англ. М.: Прогресс. 1966. 162с. Излагается ряд основных понятий и некоторые методы теории графов, позволяющие решать задачи из различных областей науки и техники. На основе этих методов в ней дан анализ нескольких производственно-экономических задач. Книга может быть использована для первого ознакомления с теорией графов и ее приложениями. Для лиц, изучающих проблемы...
  • №277
  • 1,39 МБ
  • добавлен
  • изменен
Петропавловск: СКГУ им. М.Козыбаева, 2013. — 210 с. ISBN 978-601-272-526-1 В последнее время теория графов стала важнейшим математическим инструментом, широко используемым в естественных, технических и других областях науки. В учебно-методическом пособии изложены основные разделы теории графов. Его содержание ориентировано, в первую очередь, на изучение алгоритмических задач...
  • №278
  • 3,69 МБ
  • добавлен
  • изменен
Элементы теории графов. Основные определения. Изоморфизм, гомеоморфизм. Пути и циклы. Деревья. Цикломатическое число и фундаментальные циклы. Планарные графы. Раскраски графов. Графы с атрибутами. Независимые множества и покрытия. Задачи и алгоритмы. Кратчайшие пути. Кратчайшее остовное дерево. Эйлеровы пути и циклы. Задача почтальона. Гамильтоновы циклы. Задача...
  • №279
  • 50,95 КБ
  • дата добавления неизвестна
  • изменен
АН СССР. Сиб. отд-е. Вычислительный центр. — Новосибирск: Наука, 1986. — 170 с. В сборник вошли статьи, написанные по материалам II и III Всесоюзных совещаний «Методы и программы решения оптимизационных задач на графах и сетях». Рассматриваются вопросы, имеющие существенное прикладное значение. Отражены последние достижения по использованию теорий графов, гиперсетей и матроидов...
  • №280
  • 3,90 МБ
  • добавлен
  • изменен
Сборник переводов. — М. : Мир, 1974. — 224 с. Идеи и методы теории графов все глубже проникают как в классические области применения этой теории, например в электротехнику, так и в новые области, например социологию и медицину. Широко используются в приложениях такие понятия теории графов, как «толщина», «число скрещиваний», «род графа», «факторы», «паросочетание». Настоящая...
  • №281
  • 4,15 МБ
  • добавлен
  • изменен
Лекции по теории графов. 1-2 курс (1-3 семестр). ННГУ ВМК кафедра МЛиВА 2002 г. Кол-во страниц: 28.
  • №282
  • 392,72 КБ
  • дата добавления неизвестна
  • изменен
Учебно-методическое пособие. - Нижний Новгород: Нижегородский госуниверситет, 2012. - 60 с. . В пособии излагаются основные понятия и фундаментальные факты теории графов, методы метрического и структурного анализа графов, алгоритмы решения экстремальных задач на графах. Рассматриваются важнейшие классы графов: деревья, двудольные графы, планарные графы. Пособие содержит также...
  • №283
  • 702,39 КБ
  • добавлен
  • изменен
Содержание. Начальные понятия теории графов. Определение графа. Графы и бинарные отношения. Откуда берутся графы. Число графов. Смежность, инцидентность, степени. Некоторые специальные графы. Графы и матрицы. Взвешенные графы. Изоморфизм. Инварианты. Операции над графами. Локальные операции. Подграфы. Алгебраические операции.
  • №284
  • 199,41 КБ
  • дата добавления неизвестна
  • изменен
Учебник. — М.: Интернет-Университет Информационных Технологий; Бином. Лаборатория знаний, 2012. — 320 с. : ил., табл. — ISBN 978-5-9556-0066-6. — (Основы информационных технологий). Учебник состоит из трех частей, посвященных вопросам анализа и разработки алгоритмов: фафы и алгоритмы, структуры данных, модели вычислений. Для понимания материала достаточно математической подготовки...
  • №285
  • 17,29 МБ
  • добавлен
  • изменен
Учебник. — М.: Интернет-Университет Информационных Технологий; Бином. Лаборатория знаний, 2012. — 320 с. : ил., табл. — (Основы информационных технологий). Учебник состоит из трех частей, посвященных вопросам анализа и разработки алгоритмов: фафы и алгоритмы, структуры данных, модели вычислений. Для понимания материала достаточно математической подготовки в объеме первого...
  • №286
  • 3,85 МБ
  • добавлен
  • изменен
Учебное пособие / В. А. Алексеева. - Ульяновск: УлГТУ, 2014. - 127 с. -ISBN 978-5-9795-1233-4 Содержит основные сведения по следующим разделам дискретной математики: теория множеств, комбинаторика, теория графов, математическая логика. Представлены примеры решения задач, которые могут быть использованы для подготовки и выполнения контрольных и практических заданий по курсу...
  • №287
  • 775,44 КБ
  • добавлен
  • изменен
Учебное пособие. - Казань: Изд-во Казан. гос. ун-та, 2006. - 78 с. Пособие содержит разделы, традиционно излагаемые в общем курсе дискретной математики. оно также может быть использовано в качестве основы для специальных курсов по теории графов и теории автоматов.
  • №288
  • 924,56 КБ
  • дата добавления неизвестна
  • изменен
Учебное пособие. — Казань: Изд-во Казанск. гос. архитект.-строит. ун-та, 2013. — 87 с. — ISBN 978-5-7829-0407-4. Учебное пособие предназначено для изучения теории графов дисциплины «Дополнительные главы математики» студентами дневного отделения направления подготовки 230400 «Информационные системы и технологии». История возникновения. Основные понятия и их пояснение на...
  • №289
  • 1,18 МБ
  • добавлен
  • изменен
Киев: Наукова думка, 1991. - 192 с. Монография посвящена теоретическим и прикладным вопросам теории графов. Наряду с известными и общепринятыми способами представления графов предлагается способ задания графа с помощью некоторой квадратичной формы. Изложены элементы теории сложности алгоритмов для задач на графах. Рассмотрены операции на графами, заданными как традиционными...
  • №290
  • 4,80 МБ
  • дата добавления неизвестна
  • изменен
Учебное пособие. — Екатеринбург: Уральский государственный университет им. А.М. Горького, 2008. — 157 с. Основой для данного учебного пособия послужили лекции, которые читались авторами для студентов математико-механического факультета Уральского государственного университета им. А. М. Горького, обучающихся по специальностям "Математика, прикладная математика", "Математика,...
  • №291
  • 1,10 МБ
  • добавлен
  • изменен
М.: Наука, 1974. - 368 с. Монография известных американских специалистов по исследованию операций посвящена теоретическим и прикладным вопросам теории графов. В первой части книги рассматриваются основные понятия и проблемы теории графов. Во второй - приводится множество интересных приложений теории графов в различных областях науки и техники.
  • №292
  • 3,77 МБ
  • дата добавления неизвестна
  • изменен
М.: Наука, 1974. - 368 с. Посвящена теоретическим и прикладным вопросам теории графов. В первой части рассматриваются основные понятия и проблемы теории графов. Во второй части приводится множество интересных приложений теории графов в различных областях науки и техники, таких, как экономика, исследование операций, кибернетика, теория игр, лингвистика, передача данных и др. Книга...
  • №293
  • 12,80 МБ
  • добавлен
  • изменен
Нижний Новгород, 2001. — 13 с. Методические указания содержат основные понятия из области подходов к решению экстремальных задач переборного типа на графовых структурах. Дается содержательное описание объекта исследования, строится общая математическая модель, ставятся оптимизационные задачи на графах, предлагаются алгоритмы ре-шения поставленных оптимизационных задач. Приводится...
  • №294
  • 140,43 КБ
  • добавлен
  • изменен
Учебное пособие. — Москва, "Высшая школа", 1976. — 392 с. В учебном пособии рассматриваются некоторые элементы теории графов; выделяются топологические, комбинаторные и прикладные аспекты теории. Большое внимание уделяется алгоритмам решения задач теории графов. Предназначается для студентов факультетов прикладной математики втузов.
  • №295
  • 8,15 МБ
  • добавлен
  • изменен
Теоретико-множественное введение,Определение графа. Вершины и ребра. Графическая интерпретация графа. Смежность и инцидентность. Локальная степень. Подграф. Полный граф. Матрицы смежностей и инциденций. Изоморфизм графов.Путь в графе и связные компоненты графа. Цепи, простые цепи, циклы, простые циклы. Операции удаления вершины, удаления ребра, подразбиения ребра. Дерево и его...
  • №296
  • 359,36 КБ
  • дата добавления неизвестна
  • изменен
Березина Л. Ю. Графы и их применение: пособие для учителей. - М.: Просвещение, 1979. - 143 с. Книга знакомит читателя с основами теории графов и ее приложениями. Доступность изложения, сочетание вопросов теории с системой упражнений и иллюстраций дают достаточно полное представление об основных идеях и методах теории графов.
  • №297
  • 5,44 МБ
  • дата добавления неизвестна
  • изменен
Пособие для учителей. — М.: Просвещение, 1979. — 143 с. Книга знакомит читателя с основами теории графов и ее приложениями. Доступность изложения, сочетание вопросов теории с системой упражнений и иллюстраций дают достаточно полное представление об основных идеях и методах теории графов. Материал данного пособия может быть использован учителем для работы с целью развития у...
  • №298
  • 4,95 МБ
  • добавлен
  • изменен
Под редакцией Вайнштейна И. А. Перевод Зыкова А. А. Москва: Изд-во Иностранной литературы, 1962. - 320 с. В книге Бержа теория графов излагается последовательно, начиная с основ. В текст включены многочисленные, зачастую забавные примеры. Книга может быть использована для первоначального изучения теории графов.
  • №299
  • 3,10 МБ
  • дата добавления неизвестна
  • изменен
М. : Изд-во иностранной литературы, 1962. — 320 с. Первая книга по теории графов на русском языке. Между тем в последние годы интерес к этой теории резко усилился как со стороны математиков, так и представителей самых различных прикладных дисциплин. Это объясняется тем, что методы теории графов успешно решают многочисленные задали теории электрических цепей, теории транспортных...
  • №300
  • 4,11 МБ
  • добавлен
  • изменен
Под ред. А. Н. Кудинова. Тверь: ТГТУ, 2005. 136 с. Представленные в пособии методы и алгоритмы позволяют эффективно решать ряд оптимизационных задач на графах, имеющих прикладную направленность в экономике и технике. К таким задачам относятся: задача о кратчайшем пути; задача коммивояжера и ее обобщение; задача о пропускных способностях сетей; об оптимальном размещении баз,...
  • №301
  • 1,22 МБ
  • дата добавления неизвестна
  • изменен
Учебное пособие - Тверь: ТГТУ, 2005. — 136 с. Под ред. А. Н. Кудинова. Представленные в пособии методы и алгоритмы позволяют эффективно решать ряд оптимизационных задач на графах, имеющих прикладную направленность в экономике и технике. К таким задачам относятся: задача о кратчайшем пути; задача коммивояжера и ее обобщение; задача о пропускных способностях сетей; об...
  • №302
  • 5,79 МБ
  • добавлен
  • изменен
Учебное пособие - Тверь: ТГТУ, 2005. — 136 с. Под ред. А. Н. Кудинова. Представленные в пособии методы и алгоритмы позволяют эффективно решать ряд оптимизационных задач на графах, имеющих прикладную направленность в экономике и технике. К таким задачам относятся: задача о кратчайшем пути; задача коммивояжера и ее обобщение; задача о пропускных способностях сетей; об...
  • №303
  • 19,09 МБ
  • добавлен
  • изменен
Учебное пособие - Москва: МАИ, 2001.- 56 с Рассмотрены принципы и программные средства создания библиотеки алгоритмов обобщенного поиска на графе. На примере библиотеки стандартных шаблонов рассмотрены основные компоненты библиотеки - прямой и обратный итераторы, обобщенные алгоритмы, функторы. В качестве примера использования метода обобщенных алгоритмов приведена схема...
  • №304
  • 535,78 КБ
  • добавлен
  • изменен
Томск: Изд-во НТЛ, 2006. - 88 с. Учебное пособие предназначено для студентов механико-математических и физико-математических факультетов университетов. Оно также может быть полезно студентам других специальностей и аспирантам, занимающимся математическим моделированием прикладных задач и оптимизацией вычислительных алгоритмов для высокопроизводительных компьютеров (кластеров)....
  • №305
  • 1,90 МБ
  • добавлен
  • изменен
Томск: Изд-во Томского ун-та, 2013. — 86 с. — ISBN 978−5−7511−2211−9 Описывается математическое моделирование прикладных задач и оптимизация вычислительных алгоритмов для высокопроизводительных компьютеров (кластеров). В книге содержатся три раздела теории графов: матрицы, связанные с графами, характеристические числа графов и параллельные алгоритмы на графах. Для специалистов,...
  • №306
  • 3,58 МБ
  • добавлен
  • изменен
Учебное пособие. — Липецк: Изд-во ЛГТУ 2018. — 83 с. — ISBN 978-5-88247-843-7. В данном учебном пособии излагаются некоторые современные методы математического моделирования: графоструктурного, нейронечёткого и интервального моделирования. В доступной форме изложены важнейшие, наиболее часто используемые определения, свойства и примеры современных подходов к математическому...
  • №307
  • 1,21 МБ
  • добавлен
  • изменен
Красноярск: ИПЦ КГТУ, 2005. - 82 с. - ISBN 5-7636-0708-2 Рассмотрена теория графов, предлагающая большой набор алгоритмов для программистов. Приведена система специальных терминов и обозначений, представляющая собой удобный математический аппарат для формализованной постановки множества задач на дискретных структурах. Предназначено для студентов направлений подготовки...
  • №308
  • 9,91 МБ
  • добавлен
  • изменен
Тбилиси: Мецниереба, 1974. — 231 с. В книге рассматривается применение методов теории графов для решения различных задач исследования операций. Основная группа излагаемых задач имеет экономическую интерпретацию (задачи календарного планирования, распределение ресурсов на сетях, размещение складов, заводов, выбор маршрутов и др.). Книга предназначена для широкого круга...
  • №309
  • 3,81 МБ
  • добавлен
  • изменен
Основные понятия теории графов. примеры приложений теории графов. основные понятия. Экстремальные пути и контуры на графах. Задача о кратчайшем пути. Задача о ранце. Задача поиска контура минимальной длины. Задача поиска контура минимальной средней длины. Путь максимальной эффективности. Путь максимальной эффективности с учетом штрафов. Псевдопотенциальные графы....
  • №310
  • 345,25 КБ
  • дата добавления неизвестна
  • изменен
УДК 681.325.5:519.1 Электронные модели задач на графах / Васильев В.В., Ралдугин Е. А.— Киев : Наук, думка, 1987.—152 с. Одним из целесообразных путей разработки аппаратных средств для решения задач на графах является синтез электронных моделирующих це- пей, создание цифровых моделей и структур, ориентированных на решение задач в сетевой форме. В работе рассмотрены методы и...
  • №311
  • 3,04 МБ
  • добавлен
  • изменен
Пособие содержит материал практического изучения основ современной дискретной математики. Приведены основные понятия из теории графов и сетей. Рассматриваются вопросы различных способов описания графов, операции над графами, задачи связности и достижимости в графах. Причем, особое внимание уделено машинным методам представления информации и компьютерным алгоритмам решения...
  • №312
  • 967,87 КБ
  • дата добавления неизвестна
  • изменен
М.: Изд-во факультета вмик МГУ, 1996. — 71 с. Материал, включенный в данное пособие, составлял приблизительно треть годового курса "Избранные главы дискретной математики", читавшегося одним из авторов пособия студентам кафедры математической кибернетики факультета вычислительной математики и кибернетики Московского государственного университета. Этот курс читался, начиная с...
  • №313
  • 944,45 КБ
  • добавлен
  • изменен
Дискретная математика: комбинаторная оптимизация на графах. - М.: Гелиос АРВ, 2003. — 232 с. В учебном пособии систематически излагается материал, входя Государственных образовательных стандартов группы специальностей «Информационная безопасность». Рассмотрены основы теории графов, основные постановки и методы решения оптимизационных задач на графах. Особое внимание уделено...
  • №314
  • 6,26 МБ
  • добавлен
  • изменен
М.: Гелиос АРБ, 2003. —232 с, ил. ISBN 5-85438-069-2 В учебном пособии систематически излагается материал, входящий в федеральный компонент дисциплины "Дискретная математика" Государственных образовательных стандартов группы специальностей "Информационная безопасность". Рассмотрены основы теории графов, основные постановки и методы решения оптимизационных задач на графах....
  • №315
  • 2,18 МБ
  • добавлен
  • изменен
В учебном пособии систематически излагается материал, входящий в федеральный компонент дисциплины "Дискретная математика" Государственных образовательных стандартов группы специальностей "Информационная безопасность". Рассмотрены основы теории графов, основные постановки и методы решения оптимизационных задач на графах. Особое внимание уделено вопросам построения алгоритмов...
  • №316
  • 1,48 МБ
  • дата добавления неизвестна
  • изменен
Учебное пособие. Елец: ЕГУ им. И. А. Бунина, 2008. - 175 с. В пособии в краткой форме рассмотрены основные определения и понятия теории графов, необходимые для решения некоторых прикладных задач дискретной математики. Каждая тема содержит теоретические сведения, которые для наглядности иллюстрируются рисунками и таблицами. Даны примеры решения типовых задач. Пособие составлено...
  • №317
  • 1009,22 КБ
  • дата добавления неизвестна
  • изменен
Графоанализатор – визуальная среда для работы с графами. Графоанализатор не только предоставляет возможность создавать и обрабатывать графы, но визуально отображать результаты работы алгоритмов. Среда поддерживает работу с ориентированными и простыми графами, нагруженными и ненагруженными. Программа реализует множество алгоритмов для обработки графов, начиная от поиска пути и...
  • №318
  • 884,67 КБ
  • дата добавления неизвестна
  • изменен
Дивовижний факт: будь-яку політичну карту можна розфарбувати всього чотирма фарбами, причому так, що сусідні країни на ній не будуть забарвлені в один колір.
  • №319
  • 20,92 КБ
  • дата добавления неизвестна
  • изменен
Пер. с англ. - Новосибирск: Издательство института математики, 2002. - 336 с. ISBN 5-86134-101-X. Книга является переводом английского издания известной книги Рейнхарда Дистеля. В книге отражено ядро современной теории графов как самостоятельной математической дисциплины. Это учебник углубленного типа, выводящий читателей на передний край исследований. Дан обзор последних...
  • №320
  • 15,51 МБ
  • добавлен
  • изменен
Учебное пособие. — Пенза: Изд-во Пенз. гос. ун-та, 2007. — 144 с.: ил. Книга посвящена теории графов и состоит из пяти разделов. В первом даны основные понятия и определения теории графов, рассмотрены виды графов и способы их описания. Второй раздел посвящен вопросу о связности ориентированных графов. Важнейший вид графов - деревья~- рассмотрен в третьем разделе. Разобраны...
  • №321
  • 1,04 МБ
  • дата добавления неизвестна
  • изменен
Основные понятия теории графов. связность в орграфах. деревья. пути и маршруты в графах. циклы.
  • №322
  • 927,49 КБ
  • дата добавления неизвестна
  • изменен
Пенза: Изд-во Пенз. гос. ун-та, 2004. - 139 с. Книга посвящена теории графов и состоит из пяти разделов. В первом даны основные понятия и определения теории графов, рассмотрены виды графов и способы их описания. Второй раздел посвящен вопросу о связности ориентированных графов. Важнейший вид графов - деревья - рассмотрен в третьем разделе. Разобраны задачи описания и пересчета...
  • №323
  • 494,19 КБ
  • добавлен
  • изменен
Киев: Наукова думка, 1982. — 144 с. В монографии рассматривается ряд экстремальных и комбинаторных задач, возникающих при алгебраическом исследовании проблемы раскраски плоских графов. С помощью системы линейных и нелинейных уравнений исследуется проблема четырех красок. Приводятся более простые доказательства справедливости теоремы для некоторых классов плоских графов и...
  • №324
  • 1,41 МБ
  • дата добавления неизвестна
  • изменен
Данное пособие содержит основные сведения по теории графов, описание некоторых алгоритмов на графах и учебно-методические рекомендации по ре- шению задач с помощью специально разработанных программ на языке Delphi. В пособии приводится ряд примеров для разных типов задач, возникающих в дискретной математике, прикладной комбинаторике и теории алгоритмов. Пособие...
  • №325
  • 1,07 МБ
  • добавлен
  • изменен
М.: Наука, 1985. - 352 с. Книга посвящена вопросам использования методов теории графов для исследования структуры сложных программ, определения их параметров, верификации, организации хранения и поиска информации, распределения памяти и для решения других вопросов, возникающих в системном программировании и смежных областях.
  • №326
  • 10,23 МБ
  • дата добавления неизвестна
  • изменен
М.: Наука, 1985. - 352 с. Книга посвящена вопросам использования методов теории графов для исследования структур сложных программ, определения их параметров, верификации, организации хранения и поиска информации, распределения памяти и для решения других вопросов, возникающих в системном программировании и смежных областях.
  • №327
  • 14,76 МБ
  • дата добавления неизвестна
  • изменен
Новосибирск: ООО «Сибирское Научное Издательство», 2009. — 300 с. ISBN 978-591124-036-3 Книга содержит более 2500 относящихся к графам терминов вместе с их ясными и сжатыми определениями. Помимо базовой терминологии теории графов в неё включены термины и определения по информатике. Каждый термин приводится на английском и русском языках, после чего следует его описание. Книга...
  • №328
  • 1,37 МБ
  • добавлен
  • изменен
Новосибирск: Наука, 1994. - 360 с. Книга представляет собой справочник программиста и содержит систематическое изложение алгоритмов на деревьях, образующих один из наиболее важных и широко используемых в программировании классов алгоритмов теории графов. Даны основные математические понятия и модели, методы и алгоритмы, связанные с различными приложениями теории графов....
  • №329
  • 6,53 МБ
  • добавлен
  • изменен
М.: Наука, 1981. - 344 с. Книга посвящена комбинаторной теории многогранников. Наряду с классическими результатами представлена новая проблематика, порожденная задачами оптимизации. Устанавливаются и исследуются связи многогранников с графами и проективными геометриями, излагаются способы построения выпуклых оболочек допустимых областей в задачах целочисленного программирования....
  • №330
  • 4,67 МБ
  • дата добавления неизвестна
  • изменен
М.: Наука, 1990. — 384 с. Для студентов специальностей "Математика", "Прикладная математика". В книге излагаются основы теории графов, обсуждаются некоторые известные проблемы. Приводятся примеры сведения прикладных задач к задачам теории графов и использования аппарата этой теории. Отдельная глава посвящена комбинаторным алгоритмам, связанным с поиском структурных и числовых...
  • №331
  • 8,19 МБ
  • дата добавления неизвестна
  • изменен
М., Наука, 1990 — 384 с. Для студентов специальностей "Математика", "Прикладная математика". В книге излагаются основы теории графов, обсуждаются некоторые известные проблемы. Приводятся примеры сведения прикладных задач к задачам теории графов и использования аппарата этой теории. Отдельная глава посвящена комбинаторным алгоритмам, связанным с поиском структурных и числовых...
  • №332
  • 5,69 МБ
  • добавлен
  • изменен
2005 год. Основные понятия теории графов. Понятия смежности, инцидентности, степени. Маршруты и пути. Матрицы смежности и инцидентности. Связность. Компоненты связности. Матрицы достижимости и связности. Расстояния в графе. Нагруженные графы. Деревья и циклы. Решение контрольных задач. Компоненты сильной связности ориентированного графа. Минимальный путь в...
  • №333
  • 238,76 КБ
  • дата добавления неизвестна
  • изменен
Уфимск. гос. авиац. техн. ун-т; Сост. Н. И. Житникова, Г. И. Федорова, А. К. Галимов. - Уфа, 2005. - 39 с. Практикум содержит основные сведения о теории графов, примеры решения контрольных задач и задания для самостоятельной работы. Предназначен для студентов факультета информатики и робототехники специальности 010503: «Математическое обеспечение и администрирование...
  • №334
  • 237,70 КБ
  • дата добавления неизвестна
  • изменен
Учебное пособие. — М.: Изд-во РУДН, 2013. — 179 с. — ISBN 5-209-01493-2 В пособии излагаются основы теории графов и алгоритмов на графах. Книга является продолжением курса дискретной математики: «Часть I. Комбинаторика» и «Часть II. Математическая логика». Теория графов является частью науки дискретной математики. Дискретная математика состоит из следующих разделов:...
  • №335
  • 3,03 МБ
  • добавлен
  • изменен
Издательство МЦНМО, 2010, -457 c. Теория карт (иногда называемых также вложенными графами, или ленточными графами, или толстыми графами, или графами с вращениями), или, другими словами, топологическая теория графов, представляет собой старую и хорошо развитую область комбинаторики. Она законно гордится такими классическими результатами, как формула Эйлера (связывающая число...
  • №336
  • 6,68 МБ
  • добавлен
  • изменен
М.: Вузовская книга, 2004. - 664 с. - ISBN: 5-9502-0057-8 Систематическое введение в теорию графов, построенное в соответствие с внутренней логикой ее развития. Основные положения доказываются и иногда иллюстрируются примерами прикладного характера. Многие результаты, не являющиеся необходимыми, приводятся в виде упражнений и дополнений. Для студентов вузов по специальности...
  • №337
  • 4,95 МБ
  • дата добавления неизвестна
  • изменен
М.: Вузовская книга, 2004. - 664 с. - ISBN: 5-9502-0057-8 Формат: djvu - сама книга; doc - дополнительные исправления в книге Зыкова А. А. "Основы теории графов". Систематическое введение в теорию графов, построенное в соответствии с внутренней логикой ее развития. Основные положения доказываются и иногда иллюстрируются примерами прикладного характера. Многие результаты, не...
  • №338
  • 12,64 МБ
  • дата добавления неизвестна
  • изменен
М.: Наука, 1987. - 384 с. Систематическое введение в теорию графов, построенное в соответствии с внутренней логикой ее развития. Основные положения доказываются и иногда иллюстрируются примерами прикладного характера. Многие результаты, не являющиеся необходимыми для последовательного развертывания теории, приводятся в виде упражнений и дополнений. Для студентов и аспирантов...
  • №339
  • 5,73 МБ
  • добавлен
  • изменен
М.: Наука, Сибирское отделение, 1969. — 554 c. Классический учебник по теории графов. Задачи, приводящие к исследованию графов, возникают в самых различных областях математики и ее приложений; количество таких задач особенно быстро растет в последнее время, и для их своевременного решения необходимо интенсивно разрабатывать общие методы теории графов. Настоящая монография почти не...
  • №340
  • 5,72 МБ
  • дата добавления неизвестна
  • изменен
Омск: Изд-во ОмГУ, 2013. - 80 с. ISBN 978-7779-1668-6. Рассматриваются известные комбинаторные задачи на графах в алгоритмической постановке, приводятся алгоритмы решения этих задач. Обсуждаются основные структуры данных для представления графов в памяти компьютера. Излагается введение в теорию сложности вычислений. Приведён необходимый теоретический материал и...
  • №341
  • 1,85 МБ
  • добавлен
  • изменен
Омск: Изд-во ОмГУ, 2012. - 80 с. ISBN 978-5-7779-1527-6. Рассматриваются основные понятия, известные классические утверждения и задачи теории графов. Приведён теоретический материал и упражнения для практических занятий первой части учебного курса «Теория графов и комбинаторные алгоритмы». Для студентов математических специальностей очной формы обучения. Рецензенты:...
  • №342
  • 1,84 МБ
  • добавлен
  • изменен
Монография. — М.: Физматлит, 2003. — 190 с. Первая в мировой литературе монография, содержащая описание нового метода классификации помеченных графов (древесная классификация) и основанного на ней нового метода исследования степенных рядов. Систематически и последовательно излагается древесная классификация помеченных графов. Вводится понятийный аппарат этой классификации и...
  • №343
  • 1,28 МБ
  • дата добавления неизвестна
  • изменен
Учебное пособие. – Самара: Изд-во Самар. гос. аэрокосм. ун-та, 2013. – 48с. ISBN 978-5-7883-0950-7 В пособии содержатся основные сведения о теории графов, приводятся примеры задач, решаемых методами теории графов, описываются алгоритмы их решения. Изложение материала иллюстрируется примерами. Приведен вариант расчетной работы по теории графов. Рассчитано на студентов...
  • №344
  • 402,22 КБ
  • добавлен
  • изменен
Москва: "Наука" 1980. — 140 с. Книга Камерона и ван Линта представляет беглый, но емкий обзор по современной теории кодирования; в ней с особенной четкостью оттенены комбинаторные аспекты. Изложение носит конспективный характер, что делает книгу удобным пособием для специалистов по теории кодирования и комбинаторному анализу.
  • №345
  • 10,34 МБ
  • добавлен
  • изменен
М.: Наука, 1980. — 139 с. Книга Камерона и ван Линта представляет беглый, но емкий обзор по современной теории кодирования: в ней с особенной четкостью оттенены комбинаторные аспекты. Изложение носит конспективный характер, что делает книгу удобным пособием для специалистов по теории кодирования и комбинаторному анализу. Предисловие переводчика Введение Краткое введение...
  • №346
  • 3,20 МБ
  • дата добавления неизвестна
  • изменен
М.Київ. КНУ ім. Тараса Шевченка. факультет кібернетики 2012р. 90 стр. У посібнику викладаються основи. теорії графів.Посібник призначено для самостійної роботи; ним можна. користуватися як при вивченні теоретичного курсу, так і під час практичних занять. з дискретної математики.
  • №347
  • 936,27 КБ
  • добавлен
  • изменен
СПб.: Санкт-Петербургское отделение Мат. инст. им. В.А. Стеклова РАН, 2018. — 183 с. Когда-то я хотел написать книгу по теории графов — обзорный курс. Сначала книга была небольшой, состояла в основном из теорем, рассказываемых на курсе Дискретной математике в 211 группе мат-меха СПбГУ (эта группа неофициально называлась ПОМИ-потоком...). Потом книга становилась все больше и...
  • №348
  • 1,84 МБ
  • добавлен
  • изменен
СПб.: Санкт-Петербургское отделение Мат. института им. В. А. Стеклова РАН, 2017. — 482 с. Работа над книгой началась осенью 2009 года с записи курса лекции для 211 группы мат-меха СПбГУ. Это был так называемый ПОМИ-поток, в группе были собраны сильные студенты и я читал им обзорный курс теории графов под названием “Дискретная математика”. Этот курс мне очень нравился и нравится до...
  • №349
  • 3,76 МБ
  • добавлен
  • изменен
Спб.: - 420 с. Текущая электронная версия неизданной книги (на основе спецкурсa автора "Теория графов. Дополнительные главы")
  • №350
  • 8,48 МБ
  • добавлен
  • изменен
Де Агостини, 2014. — 144 c. — Мир математики №11. Наш мир полон не только букв и цифр, но и самых разных изображений. Это картины, фотографии, произведения искусства, многочисленные схемы. Вспомните схему вашей линии метро или автобусного маршрута — это всего лишь линия с точками, рядом с которыми подписаны названия остановок. Подобные схемы из точек и линий называются графами....
  • №351
  • 46,31 МБ
  • добавлен
  • изменен
Учебное пособие для специальности 1-40 01 01 "Программное обеспечение информационных техно-логий"./ Каскевич В.И., Федосик Е.А., кол. авт. Белорусский национальный технический университет, Кафедра "Высшая математика N1". – Минск: БНТУ,, 2010. –70с. ISBN - Учебное пособие содержит необходимые сведения по двум базовым разделам высшей математики. Рассмотрены основные определения,...
  • №352
  • 1,06 МБ
  • добавлен
  • изменен
СПб.: БХВ-Петербург, 2003. — 1104 c. Книга содержит изложение фундаментальных основ современных компьютерных технологий, связанных с применением теории графов. Приведены основные модели, методы и алгоритмы прикладной теории графов. Для научных работников, инженеров, преподавателей, аспирантов и студентов. Обработанный скан с оглавлением.
  • №353
  • 15,04 МБ
  • добавлен
  • изменен
Пер. с англ. — М.: Мир, 1986. —392 с. Недавно получено строгое математическое решение трудных задач, связанных со свойствами компонент случайных графов, моделирующих разнообразные процессы физики и техники. Книга известного американского математика содержит последние результаты в этой области. Для научных работников, интересующихся вопросами теория вероятностей, теории графов и...
  • №354
  • 6,78 МБ
  • добавлен
  • изменен
Самара: [б.и.], 2002. — 37 с. Пособие содержит методические указания для выполнения расчётно-графической работы по теории графов. Рассматриваются задания для случаев неориентированных и ориентированных графов. Пособие рекомендовано к изданию кафедрой прикладной математики Самарского государственного аэрокосмического университета. Волновой метод. Определение расстояний в...
  • №355
  • 295,65 КБ
  • добавлен
  • изменен
2-е изд. — М.: Физматлит, 2004. — 256 с. — (Теория вероятностей и математическая статистика). — ISBN: 5-9221-0486-1. Книга посвящена случайным графам, случайным подстановкам, системам случайных линейных уравнений в конечных полях и уравнениям, содержащим неизвестную подстановку. Изложение отличается систематическим использованием обобщённой схемы размещения, при котором многие...
  • №356
  • 1,56 МБ
  • добавлен
  • изменен
Редакция "Народное образование", 1999 - ISBN 5-87953-133-3. В книге систематизированно излагаются основы теории графов. Подробно освещаются ее классические вопросы и проблемы: уникурсальность и гамильтоновость графов, планарность графов и теория раскраски, теория замощений и др. Адресуя книгу, в первую очередь, учителям и школьникам, авторы пытались сочетать математическую...
  • №357
  • 8,49 МБ
  • добавлен
  • изменен
Киев: "Освіта України", 2014. - 558 с. Многотомная работа содержит систематическое изложение математических дисциплин, используемых при моделировании и исследованиях математических моделей систем. В работе излагаются основы теории множеств, отношений, поверхностей, пространств, алгебраических систем, матриц, графов, математической логики, теории формальных грамматик и автоматов,...
  • №358
  • 3,29 МБ
  • добавлен
  • изменен
Киев: "Освіта України", 2015. - 512 с. Многотомная работа содержит систематическое изложение математических дисциплин, используемых при моделировании и исследованиях математических моделей систем. В работе излагаются основы теории множеств, отношений, поверхностей, пространств, алгебраических систем, матриц, графов, математической логики, теории формальных грамматик и автоматов,...
  • №359
  • 3,07 МБ
  • добавлен
  • изменен
Киев: "Освіта України", 2015. - 541 с. Многотомная работа содержит систематическое изложение математических дисциплин, используемых при моделировании и исследованиях математических моделей систем. В работе излагаются основы теории множеств, отношений, поверхностей, пространств, алгебраических систем, матриц, графов, математической логики, теории формальных грамматик и автоматов,...
  • №360
  • 3,85 МБ
  • добавлен
  • изменен