| |
| Algorithmic aspects of graph connectivity, Nagamochi, Hiroshi Ibaraki, Toshihide |
|
|
| Автор: Gross
Название: Handbook of Graph Theory, Second Edition
ISBN: 1439880182 ISBN-13(EAN): 9781439880180
Издательство: Taylor&Francis
Рейтинг:
Цена: 9350 р.
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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 400 pages longer than its predecessor--incorporates 14 new sections. Each chapter includes lists of essential definitions and facts, accompanied by examples, tables, remarks, and, in some cases, conjectures and open problems. A bibliography at the end of each chapter provides an extensive guide to the research literature and pointers to monographs. In addition, a glossary is included in each chapter as well as at the end of each section. This edition also contains notes regarding terminology and notation. With 34 new contributors, this handbook is the most comprehensive single-source guide to graph theory. It emphasizes quick accessibility to topics for non-experts and enables easy cross-referencing among chapters. | в Мои желания |
| |
|
|
| Автор: Godsil Chris, Royle Gordon F.
Название: Algebraic Graph Theory
ISBN: 0387952411 ISBN-13(EAN): 9780387952413
Издательство: Springer
Рейтинг:
Цена: 6678 р.
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Algebraic graph theory is a combination of two strands. The first is the study of algebraic objects associated with graphs. The second is the use of tools from algebra to derive properties of graphs. This work illustrates the main tools and ideas of algebraic graph theory. | в Мои желания |
| |
|
|
| Название: Introduction to graph theory: h3 mathematics
ISBN: 9812705252 ISBN-13(EAN): 9789812705259
Издательство: World Scientific Publishing
Рейтинг:
Цена: 11951 р.
Наличие на складе: Нет в наличии.
Описание: 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
new Singapore mathematics curriculum for junior college. The book builds on the verity that graph theory at this level is a subject that lends itself well to the development of
mathematical reasoning and proof.
| в Мои желания |
| |
|
|
| Название: Walk through combinatorics, a: an introduction to enumeration and graph theory (2nd edition)
ISBN: 9812568859 ISBN-13(EAN): 9789812568854
Издательство: World Scientific Publishing
Цена: 6084 р.
Наличие на складе: Нет в наличии.
Описание: This is a textbook for an introductory combinatorics course that can take up one or two semesters. An extensive list of problems, ranging from routine exercises
to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra
choices if they want to shift the emphasis of their course.
Just as with the first edition, the new edition walks the reader through the classic parts of combinatorial enumeration
and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand,
showing that some questions at the forefront of research are comprehensible and accessible for the talented and hard-working undergraduate. The basic topics discussed are: the
twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings and Eulerian and Hamiltonian cycles. The selected advanced
topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, and algorithms and complexity.
As the goal of the book is to encourage
students to learn more combinatorics, every effort has been made to provide them with a not only useful, but also enjoyable and engaging reading.
| в Мои желания |
| |
|
|
| Название: Introduction to graph theory: h3 mathematics
ISBN: 9812703861 ISBN-13(EAN): 9789812703866
Издательство: World Scientific Publishing
Рейтинг:
Цена: 7497 р.
Наличие на складе: Нет в наличии.
Описание: 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
new Singapore mathematics curriculum for junior college. The book builds on the verity that graph theory at this level is a subject that lends itself well to the development of
mathematical reasoning and proof.
| в Мои желания |
| |
|
|
| Название: Walk through combinatorics, a: an introduction to enumeration and graph theory (2nd edition)
ISBN: 9812568867 ISBN-13(EAN): 9789812568861
Издательство: World Scientific Publishing
Цена: 3477 р.
Наличие на складе: Нет в наличии.
Описание: This is a textbook for an introductory combinatorics course that can take up one or two semesters. An extensive list of problems, ranging from routine exercises
to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra
choices if they want to shift the emphasis of their course.
Just as with the first edition, the new edition walks the reader through the classic parts of combinatorial enumeration
and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand,
showing that some questions at the forefront of research are comprehensible and accessible for the talented and hard-working undergraduate.The basic topics discussed are: the
twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings and Eulerian and Hamiltonian cycles. The selected advanced
topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, and algorithms and complexity. As the goal of the book is to encourage students to learn
more combinatorics, every effort has been made to provide them with a not only useful, but also enjoyable and engaging reading.
| в Мои желания |
| |
|
|
| Название: Graph algorithms and applications 5
ISBN: 981256845X ISBN-13(EAN): 9789812568458
Издательство: World Scientific Publishing
Рейтинг:
Цена: 12277 р.
Наличие на складе: Нет в наличии.
Описание: This book contains Volume 8 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 biology, computational geometry, computer graphics, computer-aided design, computer and interconnection networks, constraint systems, databases, graph drawing, graph embedding and layout, knowledge representation, multimedia, software engineering, telecommunications networks, user interfaces and visualization, and VLSI circuit design.Graph Algorithms and Applications 5 presents contributions from prominent authors and includes selected papers from the Tenth International Symposium on Graph Drawing (GD 22). All papers in the book have extensive diagrams and offer a unique treatment of graph algorithms focusing on the important applications. | в Мои желания |
| |
|
|
| Название: Graph algorithms and applications 4
ISBN: 9812568441 ISBN-13(EAN): 9789812568441
Издательство: World Scientific Publishing
Рейтинг:
Цена: 12277 р.
Наличие на складе: Нет в наличии.
Описание: 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 biology, computational geometry, computer graphics, computer-aided design, computer and interconnection networks, constraint systems, databases, graph drawing, graph embedding and layout, knowledge representation, multimedia, software engineering, telecommunications networks, user interfaces and visualization, and VLSI circuit design.Graph Algorithms and Applications 4 presents contributions from prominent authors and includes selected papers from (a) the Seventh International Workshop on Algorithms and Data Structures (WADS 21) and (b) the 21 Symposium on Graph Drawing (GD 21). All papers in the book have extensive diagrams and offer a unique treatment of graph algorithms focusing on the important applications. | в Мои желания |
| |
|
|
| Автор: Gibbons
Название: Algorithmic Graph Theory
ISBN: 0521288819 ISBN-13(EAN): 9780521288811
Издательство: Cambridge Academ
Рейтинг:
Цена: 3258 р.
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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) and covers many of the major classical theorems, the emphasis is on algorithms and thier complexity: which graph problems have known efficient solutions and which are intractable. For the intractable problems a number of efficient approximation algorithms are included with known performance bounds. Informal use is made of a PASCAL-like programming language to describe the algorithms. A number of exercises and outlines of solutions are included to extend and motivate the material of the text. | в Мои желания |
| |
|
|
| Автор: Li
Название: Generalized Connectivity of Graphs
ISBN: 3319338277 ISBN-13(EAN): 9783319338279
Издательство: Springer
Рейтинг:
Цена: 4124 р.
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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 complexity, sharp bounds, Nordhaus-Gaddum-type results, maximum generalized local connectivity, extremal problems, random graphs, multigraphs, relations with the Steiner tree packing problem and generalizations of connectivity. This book enables graduate students to understand and master a segment of graph theory and combinatorial optimization. Researchers in graph theory, combinatorics, combinatorial optimization, probability, computer science, discrete algorithms, complexity analysis, network design, and the information transferring models will find this book useful in their studies. | в Мои желания |
| |
|
|
| Автор: Habib
Название: Probabilistic Methods for Algorithmic Discrete Mathematics
ISBN: 3540646221 ISBN-13(EAN): 9783540646228
Издательство: Springer
Рейтинг:
Цена: 13612 р.
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The book gives an accessible account of modern probabilistic methods for analyzing combinatorial structures and algorithms. It will be an useful guide for
graduate students and researchers.Special features included: a simple treatment of Talagrand's inequalities and their applications; an overview and many carefully worked out examples
of the probabilistic analysis of combinatorial algorithms; a discussion of the "exact simulation" algorithm (in the context of Markov Chain Monte Carlo Methods); a general method for
finding asymptotically optimal or near optimal graph colouring, showing how the probabilistic method may be fine-tuned to exploit the structure of the underlying graph; a succinct
treatment of randomized algorithms and derandomization techniques.
| в Мои желания |
| |
|
|
| Автор: Klin
Название: Algorithmic Algebraic Combinatorics and Gr?bner Bases
ISBN: 3642019595 ISBN-13(EAN): 9783642019593
Издательство: Springer
Рейтинг:
Цена: 13612 р.
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Introduces readers to diverse areas of modern pure and applied algebraic combinatorics and finite geometries with an emphasis on algorithmic aspects and the use of the theory of Grobner bases. This book covers coherent configurations, association schemes, permutation groups, Latin squares, the Jacobian conjecture and mathematical chemistry. | в Мои желания |
| |
|
Добавить в корзину
В Контакте 
Мобильная версия