Зарегистрироваться
Восстановить пароль
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
  • 15,22 МБ
  • добавлен
  • изменен
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...
  • №2
  • 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...
  • №3
  • 5,66 МБ
  • добавлен
  • изменен
Springer, 2019. — 329 p. — (Developments in Mathematics 60). — ISBN 3030245810. Magic and antimagic labelings are among the oldest labeling schemes in graph theory. This book takes readers on a journey through these labelings, from early beginnings with magic squares up to the latest results and beyond. Starting from the very basics, the book offers a detailed account of all magic...
  • №4
  • 7,90 МБ
  • добавлен
  • изменен
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...
  • №5
  • 6,57 МБ
  • добавлен
  • изменен
Springer, 2012. — 305 p. — (Universitext). — ISBN 978-1-4614-4528-9, 978-1-4614-4529-6. 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...
  • №6
  • 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...
  • №7
  • 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...
  • №8
  • 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...
  • №9
  • 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,...
  • №10
  • 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...
  • №11
  • 1,70 МБ
  • добавлен
  • изменен
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...
  • №12
  • 972,94 КБ
  • дата добавления неизвестна
  • изменен
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...
  • №13
  • 3,57 МБ
  • добавлен
  • изменен
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
  • №14
  • 41,89 МБ
  • добавлен
  • изменен
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...
  • №15
  • 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...
  • №16
  • 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...
  • №17
  • 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...
  • №18
  • 6,02 МБ
  • добавлен
  • изменен
Издательство 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,...
  • №19
  • 4,55 МБ
  • добавлен
  • изменен
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...
  • №20
  • 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...
  • №21
  • 432,45 КБ
  • добавлен
  • изменен
Mineola: Dover Publications, 2004. — 437 p. The ever-expanding field of extremal graph theory encompasses a diverse array of problem-solving methods, including applications to economics, computer science, and optimization theory. This volume, based on a series of lectures delivered to graduate students at the University of Cambridge, presents a concise yet comprehensive treatment...
  • №22
  • 83,12 МБ
  • добавлен
  • изменен
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...
  • №23
  • 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...
  • №24
  • 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...
  • №25
  • 2,69 МБ
  • добавлен
  • изменен
Издательство 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...
  • №26
  • 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...
  • №27
  • 6,13 МБ
  • дата добавления неизвестна
  • изменен
Издательство 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...
  • №28
  • 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...
  • №29
  • 3,93 МБ
  • добавлен
  • изменен
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...
  • №30
  • 30,79 МБ
  • добавлен
  • изменен
Springer Nature Switzerland AG, 2018. — XIII+384 p. — (Lecture Notes in Computer Science, 11159). — ISBN 978-3-030-00256-5. This book constitutes the revised selected papers of the 44th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2018, held in Cottbus, Germany, in June 2018. The 30 full papers presented in this volume were carefully reviewed and...
  • №31
  • 3,56 МБ
  • добавлен
  • изменен
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...
  • №32
  • 29,68 МБ
  • добавлен
  • изменен
Издательство 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...
  • №33
  • 1,64 МБ
  • добавлен
  • изменен
Издательство 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...
  • №34
  • 2,07 МБ
  • добавлен
  • изменен
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...
  • №35
  • 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...
  • №36
  • 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;...
  • №37
  • 7,07 МБ
  • добавлен
  • изменен
Springer, 2019. — 97 p. — (Springer Briefs in Mathematics). — ISBN 303016862X. This book depicts graph labelings that have led to thought-provoking problems and conjectures. Problems and conjectures in graceful labelings, harmonious labelings, prime labelings, additive labelings, and zonal labelings are introduced with fundamentals, examples, and illustrations. A new labeling with...
  • №38
  • 5,25 МБ
  • добавлен
  • изменен
Springer, 2019. — x, 94 p. — (SpringerBriefs in Mathematics). —- ISBN 978-3-030-31109-4, 978-3-030-31110-0. True PDF This book is in honor of the 80th birthday of Stephen Hedetniemi. It describes advanced material in graph theory in the areas of domination, coloring, spanning cycles and circuits, and distance that grew out of research topics investigated by Stephen Hedetniemi. The...
  • №39
  • 2,05 МБ
  • добавлен
  • изменен
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...
  • №40
  • 10,07 МБ
  • добавлен
  • изменен
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...
  • №41
  • 9,53 МБ
  • добавлен
  • изменен
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...
  • №42
  • 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...
  • №43
  • 5,89 МБ
  • добавлен
  • изменен
Издательство 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...
  • №44
  • 3,15 МБ
  • добавлен
  • изменен
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...
  • №45
  • 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
  • №46
  • 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...
  • №47
  • 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,...
  • №48
  • 7,43 МБ
  • добавлен
  • изменен
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 ....
  • №49
  • 557,10 КБ
  • добавлен
  • изменен
(Выходная информация отсутствует) 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...
  • №50
  • 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...
  • №51
  • 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.
  • №52
  • 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...
  • №53
  • 1,07 МБ
  • добавлен
  • изменен
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...
  • №54
  • 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....
  • №55
  • 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...
  • №56
  • 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...
  • №57
  • 2,55 МБ
  • добавлен
  • изменен
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...
  • №58
  • 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...
  • №59
  • 5,44 МБ
  • добавлен
  • изменен
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...
  • №60
  • 2,21 МБ
  • добавлен
  • изменен
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...
  • №61
  • 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...
  • №62
  • 4,55 МБ
  • добавлен
  • изменен
Oxford: Oxford University Press, 2010. — 145 p. This text is a concise modern introduction to the science of complex networks, and is based on lectures for university students and non-specialists. The author aims to introduce a reader without serious background in mathematics or physics to the world of networks. The lectures fill the existing gap between popular science books and...
  • №63
  • 1,47 МБ
  • добавлен
  • изменен
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...
  • №64
  • 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...
  • №65
  • 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...
  • №66
  • 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...
  • №67
  • 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...
  • №68
  • 5,15 МБ
  • добавлен
  • изменен
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...
  • №69
  • 3,14 МБ
  • добавлен
  • изменен
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...
  • №70
  • 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...
  • №71
  • 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...
  • №72
  • 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...
  • №73
  • 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...
  • №74
  • 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...
  • №75
  • 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...
  • №76
  • 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)...
  • №77
  • 13,56 МБ
  • добавлен
  • изменен
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...
  • №78
  • 11,98 МБ
  • добавлен
  • изменен
(Выходные данные отсутсвуют) 39 pages Abstract Introduction Defintions and Notation Dijkstra's Algorithm Multi-level Buicket Implementation Experimental Setup Data Interpretation Experimental Results Conclusions
  • №79
  • 357,93 КБ
  • добавлен
  • изменен
Springer, 2018. — xviii+331 p. — (Springer Optimization and Its Applications, vol. 139) — ISBN 978-3-319-94830-0. This book presents open optimization problems in graph theory and networks. Each chapter reflects developments in theory and applications based on Gregory Gutin’s fundamental contributions to advanced methods and techniques in combinatorial optimization. Researchers,...
  • №80
  • 2,23 МБ
  • добавлен
  • изменен
Издательство 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...
  • №81
  • 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...
  • №82
  • 10,29 МБ
  • дата добавления неизвестна
  • изменен
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...
  • №83
  • 1,70 МБ
  • добавлен
  • изменен
Prague: Charles University, 2013. — 78 p. The chromatic polynomial. Flows and tensions. The Tutte polynomial.
  • №84
  • 982,38 КБ
  • добавлен
  • изменен
CRC Press, 2005. — 800 p. — (Discrete Mathematics and its Applications). — ISBN 9781584885054; ISBN 978-1-4200-5714-0. 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...
  • №85
  • 9,79 МБ
  • добавлен
  • изменен
CRC, 2003. — 1192 p. 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 well...
  • №86
  • 9,22 МБ
  • дата добавления неизвестна
  • изменен
3rd edition. — Boca Raton: CRC Press, 2018. — 593 p. Graph Theory and Its Applications, Third Edition is the latest edition of the international, bestselling textbook for undergraduate courses in graph theory, yet it is expansive enough to be used for graduate courses as well. The textbook takes a comprehensive, accessible approach to graph theory, integrating careful exposition...
  • №87
  • 9,49 МБ
  • добавлен
  • изменен
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...
  • №88
  • 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....
  • №89
  • 7,70 МБ
  • добавлен
  • изменен
Выходные данные неизвестны. 10 pages. Introduction. Notation, Definitions, and an Overview of the Algorithm. The Preflow-Push Algorithm. The minimum cut algorithm. Time bonds for different implementations.
  • №90
  • 893,97 КБ
  • добавлен
  • изменен
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...
  • №91
  • 18,32 МБ
  • добавлен
  • изменен
Mount St. Mary’s University (Dept. of Math. and C.S.), 2019. — 134 p. These are notes I wrote up for my graph theory class in 2016. They contain most of the topics typically found in a graph theory course. There are proofs of a lot of the results, but not of everything. I’ve designed these notes for students that don’t have a lot of previous experience in math, so I spend some...
  • №92
  • 992,39 КБ
  • добавлен
  • изменен
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...
  • №93
  • 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...
  • №94
  • 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....
  • №95
  • 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....
  • №96
  • 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,...
  • №97
  • 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...
  • №98
  • 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...
  • №99
  • 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...
  • №100
  • 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...
  • №101
  • 9,05 МБ
  • добавлен
  • изменен
Издательство 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...
  • №102
  • 2,48 МБ
  • добавлен
  • изменен
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...
  • №103
  • 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...
  • №104
  • 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...
  • №105
  • 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....
  • №106
  • 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...
  • №107
  • 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....
  • №108
  • 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...
  • №109
  • 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...
  • №110
  • 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...
  • №111
  • 1,65 МБ
  • добавлен
  • изменен
2nd rev. and ext. Edition. — De Gruyter, 2019. — 352 p. — (Studies in Mathematics, 41). — ISBN 978-3-11-061736-8. Graph models are extremely useful for a large number of applications as they play an important role as structuring tools. They allow to model net structures – like roads, computers, telephones, social networks – instances of abstract data structures – like lists,...
  • №112
  • 6,84 МБ
  • добавлен
  • изменен
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...
  • №113
  • 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...
  • №114
  • 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...
  • №115
  • 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,...
  • №116
  • 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...
  • №117
  • 3,26 МБ
  • добавлен
  • изменен
Singapore: World Scientific, 2007. — 259 p. Contents : Preface Notation Contents Fundamental Concepts and Basic Results Isomorphisms, Subgraphs and the Complement of a Graph Bipartite Graphs and Trees Vertex-colourings of Graphs Matchings in Bipartite Graphs Eulerian Multigraphs and Hamiltonian Graphs Digraphs and Tournaments Books Recommended Index
  • №118
  • 4,35 МБ
  • добавлен
  • изменен
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...
  • №119
  • 1,93 МБ
  • добавлен
  • изменен
Zurich: ETH, 2018. — 233 p. Contents : Preface Chapter Introduction and motivation Prerequisites and notation Graphs Metric, diameter, and so on Cayley graphs, action graphs, Schreier graphs Expansion in graphs Random walks Random walks and expansion The discrete Laplace operator Expansion of Cayley graphs Matchings Probabilistic existence of expanders Ramanujan graphs Cayley...
  • №120
  • 1,88 МБ
  • добавлен
  • изменен
Издательство 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...
  • №121
  • 1,40 МБ
  • добавлен
  • изменен
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...
  • №122
  • 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...
  • №123
  • 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...
  • №124
  • 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...
  • №125
  • 6,51 МБ
  • добавлен
  • изменен
New York: Springer, 2018. — 113 p. This book is considered the first extended survey on algorithms and techniques for efficient cohesive subgraph computation. With rapid development of information technology, huge volumes of graph data are accumulated. An availability of rich graph data not only brings great opportunities for realizing big values of data to serve key applications,...
  • №126
  • 2,14 МБ
  • добавлен
  • изменен
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...
  • №127
  • 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...
  • №128
  • 2,86 МБ
  • добавлен
  • изменен
Budapest: Eotvos Lorand University, 2012. — 487 p. Contents: Preface Large graphs: an informal introduction Very large networks Huge networks everywhere What to ask about them? How to obtain information about them? How to model them? How to approximate them? How to run algorithms on them? Bounded degree graphs Large graphs in mathematics and physics Extremal graph theory...
  • №129
  • 3,37 МБ
  • добавлен
  • изменен
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...
  • №130
  • 3,94 МБ
  • добавлен
  • изменен
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...
  • №131
  • 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...
  • №132
  • 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...
  • №133
  • 590,51 КБ
  • добавлен
  • изменен
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...
  • №134
  • 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...
  • №135
  • 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...
  • №136
  • 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...
  • №137
  • 3,94 МБ
  • добавлен
  • изменен
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...
  • №138
  • 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...
  • №139
  • 24,39 МБ
  • добавлен
  • изменен
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...
  • №140
  • 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...
  • №141
  • 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...
  • №142
  • 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...
  • №143
  • 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...
  • №144
  • 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...
  • №145
  • 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...
  • №146
  • 1,09 МБ
  • добавлен
  • изменен
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...
  • №147
  • 6,26 МБ
  • добавлен
  • изменен
Издательство 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....
  • №148
  • 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...
  • №149
  • 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...
  • №150
  • 5,72 МБ
  • добавлен
  • изменен
Independently published, 2019. — 69 p. — ISBN 9781791894818, 179189481X. This short book is a supplement for "Pearls in graph theory" (см.: /file/492931/), a textbook written by Nora Hartsfield and Gerhard Ringel. We discuss bounds on Ramsey numbers, the probabilistic method, deletion-contraction formulas, the matrix theorem, chromatic polynomials, the marriage theorem and its...
  • №151
  • 584,45 КБ
  • добавлен
  • изменен
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...
  • №152
  • 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...
  • №153
  • 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...
  • №154
  • 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...
  • №155
  • 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...
  • №156
  • 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...
  • №157
  • 3,19 МБ
  • добавлен
  • изменен
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...
  • №158
  • 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...
  • №159
  • 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...
  • №160
  • 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...
  • №161
  • 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...
  • №162
  • 6,20 МБ
  • добавлен
  • изменен
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,...
  • №163
  • 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...
  • №164
  • 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...
  • №165
  • 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...
  • №166
  • 10,54 МБ
  • добавлен
  • изменен
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...
  • №167
  • 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,...
  • №168
  • 5,84 МБ
  • добавлен
  • изменен
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...
  • №169
  • 3,66 МБ
  • добавлен
  • изменен
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...
  • №170
  • 3,19 МБ
  • добавлен
  • изменен
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...
  • №171
  • 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.
  • №172
  • 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
  • №173
  • 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,...
  • №174
  • 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...
  • №175
  • 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...
  • №176
  • 1,71 МБ
  • добавлен
  • изменен
Berlin: De Gruyter, 2017. — XII + 238 p. — (De Gruyter Series in Discrete Mathematics and Applications). — ISBN 978-3-11-035134-7. 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...
  • №177
  • 1,69 МБ
  • добавлен
  • изменен
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...
  • №178
  • 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
  • №179
  • 232,60 КБ
  • добавлен
  • изменен
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,...
  • №180
  • 6,08 МБ
  • добавлен
  • изменен
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....
  • №181
  • 16,03 МБ
  • добавлен
  • изменен
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...
  • №182
  • 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...
  • №183
  • 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...
  • №184
  • 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.
  • №185
  • 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...
  • №186
  • 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...
  • №187
  • 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...
  • №188
  • 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...
  • №189
  • 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...
  • №190
  • 3,72 МБ
  • добавлен
  • изменен
Издательство 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 а...
  • №191
  • 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...
  • №192
  • 3,35 МБ
  • добавлен
  • изменен
Cambridge University Press, 2019. — 328 p. — ISBN 978-1-107-18589-0. Network flow theory has been used across a number of disciplines, including theoretical computer science, operations research, and discrete math, to model not only problems in the transportation of goods and information, but also a wide range of applications from image segmentation problems in computer vision to...
  • №193
  • 2,77 МБ
  • добавлен
  • изменен
Springer, 2019. — 184 p. — (Springer Theses). — ISBN 978-3-030-10903-5. This thesis discusses the physical and information theoretical limits of optical 3D metrology, and, based on these principal considerations, introduces a novel single-shot 3D video camera that works close to these limits. There are serious obstacles for a “perfect” 3D-camera: The author explains that it is...
  • №194
  • 9,57 МБ
  • добавлен
  • изменен
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...
  • №195
  • 24,45 МБ
  • добавлен
  • изменен
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.
  • №196
  • 13,09 МБ
  • дата добавления неизвестна
  • изменен
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)...
  • №197
  • 906,76 КБ
  • добавлен
  • изменен
Издательство 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...
  • №198
  • 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...
  • №199
  • 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,...
  • №200
  • 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...
  • №201
  • 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,...
  • №202
  • 847,41 КБ
  • добавлен
  • изменен
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...
  • №203
  • 6,84 МБ
  • добавлен
  • изменен
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...
  • №204
  • 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...
  • №205
  • 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,...
  • №206
  • 20,98 МБ
  • добавлен
  • изменен
Cambridge: Cambridge Scholars Publishing, 2019. — 310 p. — ISBN 978-1-5275-3533-6. This book considers a number of research topics in graph theory and its applications, including ideas devoted to alpha-discrepancy, strongly perfect graphs, reconstruction conjectures, graph invariants, hereditary classes of graphs, and embedding graphs on topological surfaces. It also discusses...
  • №207
  • 2,10 МБ
  • добавлен
  • изменен
2-е издание: Учеб. пособие. – Саратов: Изд-во «Научная книга», 2009. – 76 с. ISBN 978-5-9758-0905-6 Настоящее учебное пособие содержит теоретический материал и практические задания к курсу «Введение в теорию графов», читаемому в Саратовском государственном университете. Для студентов и преподавателей математических факультетов университетов и технических вузов. Теория...
  • №208
  • 1,77 МБ
  • добавлен
  • изменен
М.: ДМК Пресс, 2019. — 282 с. — ISBN 978-5-94074-408-3. Книга содержит необходимые сведения из теории алгоритмов, теории графов, комбинаторики. Рассматриваются частично рекурсивные функции, машины Тьюринга, приводятся некоторые варианты алгоритмов (ассоциативные исчисления, системы подстановок, грамматики, продукции Поста, нормальные алгоритмы Маркова, операторные алгоритмы)....
  • №209
  • 5,22 МБ
  • добавлен
  • изменен
Петропавловск: СКГУ им. М.Козыбаева, 2013. — 210 с. ISBN 978-601-272-526-1 В последнее время теория графов стала важнейшим математическим инструментом, широко используемым в естественных, технических и других областях науки. В учебно-методическом пособии изложены основные разделы теории графов. Его содержание ориентировано, в первую очередь, на изучение алгоритмических задач...
  • №210
  • 3,69 МБ
  • добавлен
  • изменен
Учебно-методическое пособие. - Нижний Новгород: Нижегородский госуниверситет, 2012. - 60 с. . В пособии излагаются основные понятия и фундаментальные факты теории графов, методы метрического и структурного анализа графов, алгоритмы решения экстремальных задач на графах. Рассматриваются важнейшие классы графов: деревья, двудольные графы, планарные графы. Пособие содержит также...
  • №211
  • 702,39 КБ
  • добавлен
  • изменен
Учебник. — М.: Интернет-Университет Информационных Технологий; Бином. Лаборатория знаний, 2012. — 320 с. : ил., табл. — ISBN 978-5-9556-0066-6. — (Основы информационных технологий). Учебник состоит из трех частей, посвященных вопросам анализа и разработки алгоритмов: фафы и алгоритмы, структуры данных, модели вычислений. Для понимания материала достаточно математической подготовки...
  • №212
  • 17,29 МБ
  • добавлен
  • изменен
Учебное пособие. - Казань: Изд-во Казан. гос. ун-та, 2006. - 78 с. Пособие содержит разделы, традиционно излагаемые в общем курсе дискретной математики. оно также может быть использовано в качестве основы для специальных курсов по теории графов и теории автоматов.
  • №213
  • 924,56 КБ
  • дата добавления неизвестна
  • изменен
Учебное пособие. — Казань: Изд-во Казанск. гос. архитект.-строит. ун-та, 2013. — 87 с. — ISBN 978-5-7829-0407-4. Учебное пособие предназначено для изучения теории графов дисциплины «Дополнительные главы математики» студентами дневного отделения направления подготовки 230400 «Информационные системы и технологии». История возникновения. Основные понятия и их пояснение на...
  • №214
  • 1,18 МБ
  • добавлен
  • изменен
Учебное пособие. — Екатеринбург: Уральский государственный университет им. А.М. Горького, 2008. — 157 с. Основой для данного учебного пособия послужили лекции, которые читались авторами для студентов математико-механического факультета Уральского государственного университета им. А. М. Горького, обучающихся по специальностям "Математика, прикладная математика", "Математика,...
  • №215
  • 1,10 МБ
  • добавлен
  • изменен
М.: Наука, 1974. - 368 с. Посвящена теоретическим и прикладным вопросам теории графов. В первой части рассматриваются основные понятия и проблемы теории графов. Во второй части приводится множество интересных приложений теории графов в различных областях науки и техники, таких, как экономика, исследование операций, кибернетика, теория игр, лингвистика, передача данных и др. Книга...
  • №216
  • 12,80 МБ
  • добавлен
  • изменен
Пособие для учителей. — М.: Просвещение, 1979. — 143 с. Книга знакомит читателя с основами теории графов и ее приложениями. Доступность изложения, сочетание вопросов теории с системой упражнений и иллюстраций дают достаточно полное представление об основных идеях и методах теории графов. Материал данного пособия может быть использован учителем для работы с целью развития у...
  • №217
  • 4,95 МБ
  • добавлен
  • изменен
Под редакцией Вайнштейна И. А. Перевод Зыкова А. А. Москва: Изд-во Иностранной литературы, 1962. - 320 с. В книге Бержа теория графов излагается последовательно, начиная с основ. В текст включены многочисленные, зачастую забавные примеры. Книга может быть использована для первоначального изучения теории графов.
  • №218
  • 3,10 МБ
  • дата добавления неизвестна
  • изменен
Под ред. А. Н. Кудинова. — Тверь: Тверской государственный технический университет (ТГТУ), 2005. — 136 с. — ISBN 5-7995-0293-0. Представленные в пособии методы и алгоритмы позволяют эффективно решать ряд оптимизационных задач на графах, имеющих прикладную направленность в экономике и технике. К таким задачам относятся: задача о кратчайшем пути; задача коммивояжера и ее обобщение;...
  • №219
  • 1,22 МБ
  • дата добавления неизвестна
  • изменен
Томск: Изд-во НТЛ, 2006. - 88 с. Учебное пособие предназначено для студентов механико-математических и физико-математических факультетов университетов. Оно также может быть полезно студентам других специальностей и аспирантам, занимающимся математическим моделированием прикладных задач и оптимизацией вычислительных алгоритмов для высокопроизводительных компьютеров (кластеров)....
  • №220
  • 1,90 МБ
  • добавлен
  • изменен
Томск: Изд-во Томского ун-та, 2013. — 86 с. — ISBN 978−5−7511−2211−9 Описывается математическое моделирование прикладных задач и оптимизация вычислительных алгоритмов для высокопроизводительных компьютеров (кластеров). В книге содержатся три раздела теории графов: матрицы, связанные с графами, характеристические числа графов и параллельные алгоритмы на графах. Для специалистов,...
  • №221
  • 3,58 МБ
  • добавлен
  • изменен
Учебное пособие. — Липецк: Изд-во ЛГТУ 2018. — 83 с. — ISBN 978-5-88247-843-7. В данном учебном пособии излагаются некоторые современные методы математического моделирования: графоструктурного, нейронечёткого и интервального моделирования. В доступной форме изложены важнейшие, наиболее часто используемые определения, свойства и примеры современных подходов к математическому...
  • №222
  • 1,21 МБ
  • добавлен
  • изменен
Красноярск: ИПЦ КГТУ, 2005. - 82 с. - ISBN 5-7636-0708-2 Рассмотрена теория графов, предлагающая большой набор алгоритмов для программистов. Приведена система специальных терминов и обозначений, представляющая собой удобный математический аппарат для формализованной постановки множества задач на дискретных структурах. Предназначено для студентов направлений подготовки...
  • №223
  • 9,91 МБ
  • добавлен
  • изменен
Тбилиси: Мецниереба, 1974. — 231 с. В книге рассматривается применение методов теории графов для решения различных задач исследования операций. Основная группа излагаемых задач имеет экономическую интерпретацию (задачи календарного планирования, распределение ресурсов на сетях, размещение складов, заводов, выбор маршрутов и др.). Книга предназначена для широкого круга...
  • №224
  • 3,81 МБ
  • добавлен
  • изменен
Основные понятия теории графов. примеры приложений теории графов. основные понятия. Экстремальные пути и контуры на графах. Задача о кратчайшем пути. Задача о ранце. Задача поиска контура минимальной длины. Задача поиска контура минимальной средней длины. Путь максимальной эффективности. Путь максимальной эффективности с учетом штрафов. Псевдопотенциальные графы....
  • №225
  • 345,25 КБ
  • дата добавления неизвестна
  • изменен
Учебное пособие. — Пенза: Пензенский государственный университет, 2002. — 100 с. Пособие содержит материал практического изучения основ современной дискретной математики. Приведены основные понятия из теории графов и сетей. Рассматриваются вопросы различных способов описания графов, операции над графами, задачи связности и достижимости в графах. Причем, особое внимание уделено...
  • №226
  • 967,87 КБ
  • дата добавления неизвестна
  • изменен
М.: Гелиос АРБ, 2003. —232 с, ил. ISBN 5-85438-069-2 В учебном пособии систематически излагается материал, входящий в федеральный компонент дисциплины "Дискретная математика" Государственных образовательных стандартов группы специальностей "Информационная безопасность". Рассмотрены основы теории графов, основные постановки и методы решения оптимизационных задач на графах....
  • №227
  • 2,18 МБ
  • добавлен
  • изменен
Учебное пособие. Елец: ЕГУ им. И. А. Бунина, 2008. - 175 с. В пособии в краткой форме рассмотрены основные определения и понятия теории графов, необходимые для решения некоторых прикладных задач дискретной математики. Каждая тема содержит теоретические сведения, которые для наглядности иллюстрируются рисунками и таблицами. Даны примеры решения типовых задач. Пособие составлено...
  • №228
  • 1009,22 КБ
  • дата добавления неизвестна
  • изменен
Учебное пособие. — Пенза: Изд-во Пенз. гос. ун-та, 2007. — 144 с.: ил. Книга посвящена теории графов и состоит из пяти разделов. В первом даны основные понятия и определения теории графов, рассмотрены виды графов и способы их описания. Второй раздел посвящен вопросу о связности ориентированных графов. Важнейший вид графов - деревья~- рассмотрен в третьем разделе. Разобраны...
  • №229
  • 1,04 МБ
  • дата добавления неизвестна
  • изменен
Основные понятия теории графов. связность в орграфах. деревья. пути и маршруты в графах. циклы.
  • №230
  • 927,49 КБ
  • дата добавления неизвестна
  • изменен
Данное пособие содержит основные сведения по теории графов, описание некоторых алгоритмов на графах и учебно-методические рекомендации по ре- шению задач с помощью специально разработанных программ на языке Delphi. В пособии приводится ряд примеров для разных типов задач, возникающих в дискретной математике, прикладной комбинаторике и теории алгоритмов. Пособие...
  • №231
  • 1,07 МБ
  • добавлен
  • изменен
М.: Наука, 1985. - 352 с. Книга посвящена вопросам использования методов теории графов для исследования структур сложных программ, определения их параметров, верификации, организации хранения и поиска информации, распределения памяти и для решения других вопросов, возникающих в системном программировании и смежных областях.
  • №232
  • 14,76 МБ
  • дата добавления неизвестна
  • изменен
Новосибирск: ООО «Сибирское Научное Издательство», 2009. — 300 с. ISBN 978-591124-036-3 Книга содержит более 2500 относящихся к графам терминов вместе с их ясными и сжатыми определениями. Помимо базовой терминологии теории графов в неё включены термины и определения по информатике. Каждый термин приводится на английском и русском языках, после чего следует его описание. Книга...
  • №233
  • 1,37 МБ
  • добавлен
  • изменен
М., Наука, 1990 — 384 с. Для студентов специальностей "Математика", "Прикладная математика". В книге излагаются основы теории графов, обсуждаются некоторые известные проблемы. Приводятся примеры сведения прикладных задач к задачам теории графов и использования аппарата этой теории. Отдельная глава посвящена комбинаторным алгоритмам, связанным с поиском структурных и числовых...
  • №234
  • 5,69 МБ
  • добавлен
  • изменен
М.: Вузовская книга, 2004. - 664 с. - ISBN: 5-9502-0057-8 Систематическое введение в теорию графов, построенное в соответствие с внутренней логикой ее развития. Основные положения доказываются и иногда иллюстрируются примерами прикладного характера. Многие результаты, не являющиеся необходимыми, приводятся в виде упражнений и дополнений. Для студентов вузов по специальности...
  • №235
  • 4,95 МБ
  • дата добавления неизвестна
  • изменен
Учебное пособие. – Самара: Изд-во Самар. гос. аэрокосм. ун-та, 2013. – 48с. ISBN 978-5-7883-0950-7 В пособии содержатся основные сведения о теории графов, приводятся примеры задач, решаемых методами теории графов, описываются алгоритмы их решения. Изложение материала иллюстрируется примерами. Приведен вариант расчетной работы по теории графов. Рассчитано на студентов...
  • №236
  • 402,22 КБ
  • добавлен
  • изменен
Москва: "Наука" 1980. — 140 с. Книга Камерона и ван Линта представляет беглый, но емкий обзор по современной теории кодирования; в ней с особенной четкостью оттенены комбинаторные аспекты. Изложение носит конспективный характер, что делает книгу удобным пособием для специалистов по теории кодирования и комбинаторному анализу.
  • №237
  • 10,34 МБ
  • добавлен
  • изменен
М.Київ. КНУ ім. Тараса Шевченка. факультет кібернетики 2012р. 90 стр. У посібнику викладаються основи. теорії графів.Посібник призначено для самостійної роботи; ним можна. користуватися як при вивченні теоретичного курсу, так і під час практичних занять. з дискретної математики.
  • №238
  • 936,27 КБ
  • добавлен
  • изменен
СПб.: Санкт-Петербургское отделение Мат. инст. им. В.А. Стеклова РАН, 2018. — 183 с. Когда-то я хотел написать книгу по теории графов — обзорный курс. Сначала книга была небольшой, состояла в основном из теорем, рассказываемых на курсе Дискретной математике в 211 группе мат-меха СПбГУ (эта группа неофициально называлась ПОМИ-потоком...). Потом книга становилась все больше и...
  • №239
  • 1,84 МБ
  • добавлен
  • изменен
СПб.: Санкт-Петербургское отделение Мат. института им. В. А. Стеклова РАН, 2017. — 482 с. Работа над книгой началась осенью 2009 года с записи курса лекции для 211 группы мат-меха СПбГУ. Это был так называемый ПОМИ-поток, в группе были собраны сильные студенты и я читал им обзорный курс теории графов под названием “Дискретная математика”. Этот курс мне очень нравился и нравится до...
  • №240
  • 3,76 МБ
  • добавлен
  • изменен
Спб.: - 420 с. Текущая электронная версия неизданной книги (на основе спецкурсa автора "Теория графов. Дополнительные главы")
  • №241
  • 8,48 МБ
  • добавлен
  • изменен
Де Агостини, 2014. — 144 c. — Мир математики №11. Наш мир полон не только букв и цифр, но и самых разных изображений. Это картины, фотографии, произведения искусства, многочисленные схемы. Вспомните схему вашей линии метро или автобусного маршрута — это всего лишь линия с точками, рядом с которыми подписаны названия остановок. Подобные схемы из точек и линий называются графами....
  • №242
  • 46,31 МБ
  • добавлен
  • изменен
Учебное пособие для специальности 1-40 01 01 "Программное обеспечение информационных техно-логий"./ Каскевич В.И., Федосик Е.А., кол. авт. Белорусский национальный технический университет, Кафедра "Высшая математика N1". – Минск: БНТУ,, 2010. –70с. ISBN - Учебное пособие содержит необходимые сведения по двум базовым разделам высшей математики. Рассмотрены основные определения,...
  • №243
  • 1,06 МБ
  • добавлен
  • изменен
Редакция "Народное образование", 1999 - ISBN 5-87953-133-3. В книге систематизированно излагаются основы теории графов. Подробно освещаются ее классические вопросы и проблемы: уникурсальность и гамильтоновость графов, планарность графов и теория раскраски, теория замощений и др. Адресуя книгу, в первую очередь, учителям и школьникам, авторы пытались сочетать математическую...
  • №244
  • 8,49 МБ
  • добавлен
  • изменен
Киев: "Освіта України", 2014. - 558 с. Многотомная работа содержит систематическое изложение математических дисциплин, используемых при моделировании и исследованиях математических моделей систем. В работе излагаются основы теории множеств, отношений, поверхностей, пространств, алгебраических систем, матриц, графов, математической логики, теории формальных грамматик и автоматов,...
  • №245
  • 8,16 МБ
  • добавлен
  • изменен
Киев: "Освіта України", 2015. - 512 с. Многотомная работа содержит систематическое изложение математических дисциплин, используемых при моделировании и исследованиях математических моделей систем. В работе излагаются основы теории множеств, отношений, поверхностей, пространств, алгебраических систем, матриц, графов, математической логики, теории формальных грамматик и автоматов,...
  • №246
  • 7,78 МБ
  • добавлен
  • изменен
Киев: "Освіта України", 2015. - 541 с. Многотомная работа содержит систематическое изложение математических дисциплин, используемых при моделировании и исследованиях математических моделей систем. В работе излагаются основы теории множеств, отношений, поверхностей, пространств, алгебраических систем, матриц, графов, математической логики, теории формальных грамматик и автоматов,...
  • №247
  • 8,97 МБ
  • добавлен
  • изменен
Киев: "Освіта України", 2015. - 494 с. Многотомная работа содержит систематическое изложение математических дисциплин, используемых при моделировании и исследованиях математических моделей систем. В работе излагаются основы теории множеств, отношений, поверхностей, пространств, алгебраических систем, матриц, графов, математической логики, теории формальных грамматик и автоматов,...
  • №248
  • 11,50 МБ
  • добавлен
  • изменен
Новосибирск: НГУ, 2010. — 109 с. Курс лекций по теории графов, читаемых для студентов Новосибирского государственного университета на кафедре теоретической кибернетики. Программа курса: Введение. Определения, понятия, примеры. Группы. Симметрическая группа Sym n . Гипероктаэдральная группа B n . Графы. Регулярные и транзитивные графы. Дистанционно-регулярные и -транзитивные графы....
  • №249
  • 804,41 КБ
  • добавлен
  • изменен
М.: Мир, 1978, 432 стр. В книге впервые в мировой литературе достаточно полно представлены разнообразные алгоритмы, связанные с нахождением структурных и числовых характеристик объектов из теории графов. В частности, подробно рассматриваются различные алгоритмы поиска решения в задаче коммивояжера. Кроме того, книга содержит большой фактический материал по исследованию потоков...
  • №250
  • 17,73 МБ
  • дата добавления неизвестна
  • изменен
Петрозаводск: Изд-во ПетрГУ, 2007. - 184 с. В учебном пособии представлен ряд важнейших алгоритмов решения оптимизационных задач, связанных с графами, и структуры данных, необходимые для достаточно простой, но эффективной реализации этих алгоритмов. Разнообразие методов, используемых для решения таких задач, иллюстрируется на примере алгоритмов поиска наибольшего потока в сети....
  • №251
  • 1,20 МБ
  • добавлен
  • изменен
Иркутск: Иркутский гос. ун. (Институт математики, экономики и информатики), 2014. - 92 с. Учебное пособие, охватывающее «теоретико-графовую» часть курса дискретной математики, который читается автором на 3-м семестре обучения в Институте математики и экономики Иркутского государственного университета. Оглавление. Введение. Графы — определение и элементы. Связные графы....
  • №252
  • 3,42 МБ
  • добавлен
  • изменен
М.: ВШЭ, 2018. — 78 с. Графы — универсальный способ кодирования информации. Они удобны для представления разнообразных сведений об объектах и связях между ними. В нашем курсе мы будем смотреть на графы, в первую очередь, с точки зрения топологии. Несмотря на то, что графы существенно дискретны, а топология изучает свойства объектов, не меняющиеся при непрерывных преобразованиях,...
  • №253
  • 1,31 МБ
  • добавлен
  • изменен
М.: ВШЭ, 2018. — 120 с. Графы — универсальный способ кодирования информации. Они удобны для представления разнообразных сведений об объектах и связях между ними. В нашем курсе мы будем смотреть на графы, в первую очередь, с точки зрения топологии. Несмотря на то, что графы существенно дискретны, а топология изучает свойства объектов, не меняющиеся при непрерывных преобразованиях,...
  • №254
  • 3,41 МБ
  • добавлен
  • изменен
Учебное пособие. Воронеж: Изд-во В ГУ , 2002. - 85 с. В учебном пособии излагаются основы теории графов; представлены разнообразные алгоритмы, связанные с нахождением структурных и числовых характеристик графов; приводятся примеры сведения прикладных задач.
  • №255
  • 720,95 КБ
  • добавлен
  • изменен
Учебное пособие для студентов направления «Бизнес-информатика» и специальности «Компьютерная безопасность». — М: РУТ (МИИТ), 2018. — 93 с. Данное учебное пособие адресовано студентам направления «Бизнес-информатика» и специальности «Компьютерная безопасность». В первой главе даются основные определения и простейшие теоремы теории графов, во второй главе разбираются некоторые...
  • №256
  • 1,04 МБ
  • добавлен
  • изменен
М.: Мир, 1998. - 653 с. Книга Ловаса Л. и Пламмера М. "Прикладные задачи теории графов. Теория паросочетаний в математике, физике, химии" написана известными специалистами по комбинаторике и охватывает различные области дискретной математики, в частности, теорию потоков, задачу о коммивояжёре, теорию матроидов, модель Изинга ферромагнетизма и линейное программирование. Здесь...
  • №257
  • 23,54 МБ
  • добавлен
  • изменен
М.: Наука, 1971. — 415 с. В монографии рассматриваются вопросы преобразования ориентированных графов и излагается систематический подход к логическому проектированию автоматов методами теории графов. Описываются свойства теоретико-множественных и алгебраических операций над графами и решаются задачи разложения сложных графов на более простые по различным операциям. Определяются...
  • №258
  • 8,40 МБ
  • добавлен
  • изменен
Учебно-методическое пособие. — Минск: ТетраСистемс, 2001. — 144 с. — ISBN 985-6577-91-8. В занимательной форме изложены основы теории графов. Книга будет полезна школьникам, абитуриентам и студентам, делающим первые шаги в освоении теории графов.
  • №259
  • 2,77 МБ
  • добавлен
  • изменен
Изд. 3-е, испр. и доп. — М.: Либроком, 2009. — 232 с. В настоящей книге в занимательной форме изложены основы теории графов. Изучение этой дисциплины на факультативах в средней школе будет способствовать развитию математического мышления учащихся, умений моделирования и облегчит усвоение школьниками вычислительной техники. Книга предназначена для школьников и учителей; задачи из...
  • №260
  • 24,32 МБ
  • добавлен
  • изменен
Сборник задач по нахождению минимального остова. В сборнике собраны задачи, в которых дан взвешеный граф, в котором нужно найти минимальный остов.
  • №261
  • 30,53 КБ
  • добавлен
  • изменен
Новосибирск: Наука. Сиб. отд-ние, 1990. — 515 с. — ISBN: 5020286141. Алгоритмы и программы решения задач на графах и сетях — В монографии систематически изложены программно реализованные алгоритмы задач теории графов. Рассмотрены задачи упаковки, покрытия, раскраски, связности и изоморфизма графов, их приложения, в частности, задачи связности случайных графов и изоморфного...
  • №262
  • 26,90 МБ
  • добавлен
  • изменен
Учебное пособие. — Иваново: Научный мир, 2017. — 40 с. — ISBN 978-5-9906509-5-4 В математическом обеспечении компьютерного моделирования дискретных систем и процессов теории графов принадлежат доминирующие позиции. В книге излагаются основания теории конечных графов с разнообразные примеры ее приложений. Пособие ориентировано на бакалавров, магистров и широкий круг специалистов в...
  • №263
  • 3,44 МБ
  • добавлен
  • изменен
Учебное пособие. — Иваново: Научный мир, 2017 — 21 с. — ISBN 978-5-9906509-4-7 Знание теории графов - одна из самых востребованных компетенций на рынке интеллектуального труда. В книге представлен исторический путь становления теории графов и широкий круг научных направлений исследований, открытием которых сопровождается этот процесс. Эффективность и универсальность научного...
  • №264
  • 1,23 МБ
  • добавлен
  • изменен
Учебное пособие. — Новосибирск: Сибирский государственный университет телекоммуникаций и информатики, 2008. — 106 с. В данном учебном пособии изложен основной теоретический материал, необходимый для изучения дискретной математики, а именно, входящего в нее раздела "Теория графов". Оглавление . Предисловие. Основные определения. Способы задания графа. Операции на графах....
  • №265
  • 2,55 МБ
  • добавлен
  • изменен
М.: МЦНМО, 2018. — 416 с. — ISBN 978-5-4439-1247-9. В основу данного учебника легли материалы семестрового курса лекций, читающегося автором в течение нескольких лет студентам первых курсов бакалавриата Санкт-Петербургского Академического университета. В учебник включены все основные разделы современной теории графов — деревья, циклы, связность в графах, паросочетания, раскраски...
  • №266
  • 6,68 МБ
  • добавлен
  • изменен
М. : Мир, 1965.— 175 с. Автором книги "Графы и их применение" является видный норвежский алгебраист Ойстин Оре. Для понимания книги вполне достаточны минимальные предварительные знания, практически не превышающие курса математики 7-8 класса. Книга будет полезна студентам всех курсов и специальностей, обучающихся по направлению 230000 "Информатика и вычислительная техника"....
  • №267
  • 6,40 МБ
  • дата добавления неизвестна
  • изменен
М. : Наука, 1980. — 336 с.: ил. Предлагаемая вниманию читателя книга норвежского математика Ойстина Оре является второй крупной монографией по теории графов, изданной на русском языке. В 1962 г. вышел перевод книги К. Бержа «Теория графов и её применения», написанной весьма сжато и абстрактно. Всё изложение в ней ведётся в сильно алгебраизированной форме. В книга Оре, напротив,...
  • №268
  • 5,21 МБ
  • добавлен
  • изменен
Проведено исследование задачи оптимального обхода графа со стохастическими весами ребер, к которой приводят некоторые транспортные задачи. Предложен критерий оптимальности, реализован алгоритм определения оптимального пути путем имитационного моделирования.
  • №269
  • 149,74 КБ
  • дата добавления неизвестна
  • изменен
М.: МЦНМО, 2011. — 136 с. — ISBN 978-5-94057-840-6. Книга посвящена теории случайных графов. Эта теория находится на стыке комбинаторики, теории графов и теории вероятностей. Книга основана на лекциях, которые автор читал на школах «Современная математика» в Дубне и «Комбинаторная математика и теория алгоритмов» в Судиславле, а также в Школе Анализа Данных Яндекса....
  • №270
  • 939,27 КБ
  • добавлен
  • изменен
М.: Мир, 1984. — 454 с. В книге специалистов из Канады и Индии излагаются основы теории графов и ее применение к сетям с сосредоточенными параметрами в электро- и вычислительной технике. Рассматриваются вопросы цикломатики, связности, устойчивости, вложимости и раскраски графов, что позволяет определить чувствительность сети, а также разработать эффективные алгоритмы анализа и...
  • №271
  • 4,83 МБ
  • дата добавления неизвестна
  • изменен
Учебное пособие для студентов направления подготовки бакалавров 010300.62 «Фундаментальная информатика и информационные технологии». — Брянск: Курсив, 2013. — 180 с. Учебник содержит теоретический материал по традиционным разделам теории конечных графов. В каждом разделе имеется практическая часть, включающая образцы решения типовых задач, а также систему упражнений для...
  • №272
  • 3,88 МБ
  • добавлен
  • изменен
Оглавление. Графоанализатор 1.2 что это? Лицензионное соглашение. Быстрый обзор. Для чего можно использовать программу. Задание графа. Алгоритмы. Дополнительная информация. Графоанализатор 1.2
  • №273
  • 509,26 КБ
  • дата добавления неизвестна
  • изменен
Курс лекций. - Тверь: ТвГУ, 2000. - 35 с. Пособие посвящено изложению первоначальных сведений о графах и представляет собой записи лекций, читаемых проф. Тайцлиным М. А. на первом курсе в рамках лекций по дискретной математике. Первый раздел содержит определения, описания способов задания графов и примеры графов, удовлетворяющих различным условиям. Во втором разделе обсуждаются...
  • №274
  • 267,85 КБ
  • дата добавления неизвестна
  • изменен
М. : Мир, 1988. — 424 с.: ил. — ISBN 5-03-001001-7. Монография канадского математика, содержащая перспективные методы и конструкции современной теории графов (связность, факторизация, раскраска, планарность и др.). Многие результаты принадлежат автору, активно работающему в области комбинаторной теории. Книга вышла в известной серии «Энциклопедия математики и ее приложений»,...
  • №275
  • 20,47 МБ
  • дата добавления неизвестна
  • изменен
Пермь : Пермский национальный исследовательский политехнический университет, 2015. — 159 с. В учебном пособии представлены основные характеристики графов и даны основные задачи, решаемые на них. Предназначено для студентов, обучающихся по специальности «Информационная безопасность автоматизированных систем», «Комплексное обеспечение информационной безопасности автоматизированных...
  • №276
  • 12,18 МБ
  • добавлен
  • изменен
М. : Мир, 1977. — 208 с. В последнее время теория графов стала важнейшим математическим инструментом, широко используемым в таких областях науки, как исследование операций, лингвистика, химия, генетика и др. Книга Р. Уилсона является вводным курсом в теорию графов; вместе с тем она затрагивает целый ряд интересных и сложных задач. В ней дано хорошее введение в теорию матроидов,...
  • №277
  • 1,96 МБ
  • добавлен
  • изменен
Пер. с англ. — М.: Мир, 1984. — 496 с.: ил. В книге американских ученых излагаются методы и алгоритмы оптимизации детерминированных и стохастических сетей различного назначения с помощью теории графов. Книга иллюстрирована большим числом примеров, взятых из различных областей науки и техники. Для специалистов, занимающихся применением вычислительной техники в экономике,...
  • №278
  • 33,38 МБ
  • добавлен
  • изменен
Пер. с англ. В. А. Евстигнеева, А. В. Косточки, Л. С. Мельникова. — М.: Мир, 2002. — 335 с. — ISBN: 5-03-003115-4. Монография известного австрийского математика посвящена теории эйлеровых графов — одному из интенсивно развивающихся разделов теории графов. Это первая монография по данной теме. В книге собраны как классические, так и современные результаты в этой области, уделено...
  • №279
  • 10,42 МБ
  • добавлен
  • изменен
Содержание пособия составляют примеры решения 10 типичных задач по теории графов, для каждой задачи даны 28 вариантов для самостоятельного решения. Перечень задач: Алгоритм поиска кратчайшего пути между двумя вершинами (Дейкстры) Нахождение в ациклическом графе маршрута с минимальным весом Задача коммивояжера Потоки. Нахождение максимального потока. Метод Форда-Фалкерсона....
  • №280
  • 31,09 МБ
  • дата добавления неизвестна
  • изменен
Под. ред. С. В. Мациевского. Пер. с нем. Е. Е. Перегуда. Учебное пособие. — Калининград: Изд-во РГУ им. И. Канта, 2008.— 205 с.: ил. На обложке: гравюра старого Кёнигсберга со своими семью мостами. В издании использованы три языка: русский, английский и немецкий. Краткое учебное пособие по теории графов с алгоритмическим уклоном, которое соответствует желаниям русских и...
  • №281
  • 2,06 МБ
  • добавлен
  • изменен
М. : Мир, 1973. — 301 с. В последнее время теория графов привлекает все более пристальное внимание специалистов различных областей знания. Наряду с традиционными применениями ее в таких науках, как физика, электротехника химии, она проникла и в науки считавшиеся раньше далекими от нее - экономику, социологию лингвистику и др. Давно известны тесные контакты теории графов с...
  • №282
  • 12,69 МБ
  • добавлен
  • изменен
Пер.с англ. и предисл. В. П. Козырева. Под ред. Г. П. Гаврилова. Изд. 2-е. — М.: Едиториал УРСС, 2003. — 296 с. — ISBN 5-354-00301-6. В последнее время теория графов привлекает всё более пристальное внимание специалистов различных областей знания. Наряду с традиционными применениями ее в таких науках, как физика, электротехника, химия, она проникла и в науки, считавшиеся раньше...
  • №283
  • 10,05 МБ
  • добавлен
  • изменен
М.: Мир, 1977. — 324 с. Монография по бурно развивающемуся разделу дискретной математики - теории перечисления графических объектов. Последняя глава содержит интересный обзор решенных и нерешенных задач перечисления графов. Изложение систематическое и достаточно подробное.
  • №284
  • 7,05 МБ
  • добавлен
  • изменен
Ульяновск : УлГТУ, 2006. — 92 с. — ISBN 5-89146-878-6 В учебном пособии изложены основы теории графов и сетей. Материал каждого раздела проиллюстрирован примерами и сопровождается подборкой задач для практических занятий, имеются контрольные задания. Содержание пособия соответствует государственному образовательному стандарту высшего образования для экономических...
  • №285
  • 984,77 КБ
  • дата добавления неизвестна
  • изменен
Учебное пособие. — Новосибирск: Сибирский гос. ун-т телекоммуникаций и информатики, 2011. — 98 с. Пособие предназначено для использования в учебном процессе преподавателями и студентами технических специальностей СибГУТИ. В данном учебном пособии изложен основной теоретический материал и описаны базовые алгоритмы решения задач на графах, изучаемые в рамках раздела "Теория графов"...
  • №286
  • 1,80 МБ
  • добавлен
  • изменен
Учебно-методическое пособие. — Кострома: Изд-во Костром. гос. технол. ун-та (КГТУ), 2011. — 24 с. В пособии рассматриваются основные понятия теории графов. Доступность изложения, сочетание теоретического материала с иллюстрирующими его примерами дают возможность использовать пособие для самостоятельной работы студентов при изучении дисциплины «Дискретная математика». Пособие...
  • №287
  • 576,25 КБ
  • добавлен
  • изменен
В этом разделе нет файлов.

Комментарии

В этом разделе нет комментариев.