Algorithmic Graph Theory and Perfect Graphs, Golumbic, Martin Charles
Автор: Hiroshi Nagamochi, Toshihide Ibaraki Название: Algorithmic Aspects of Graph Connectivity ISBN: 1108735495 ISBN-13(EAN): 9781108735490 Издательство: Cambridge Academ Рейтинг: Цена: 46470.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: With applications in communication, transportation, and production, graph connectivity has thrived using the theory of complexity and algorithms in modern computer science. This is the first thorough book on this central notion in graph and network theory, and covers new concepts and algorithms for quicker and more efficient computing.
Автор: Nagamochi, Hiroshi Ibaraki, Toshihide Название: Algorithmic aspects of graph connectivity ISBN: 0521878640 ISBN-13(EAN): 9780521878647 Издательство: Cambridge Academ Рейтинг: Цена: 97150.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: With applications in communication, transportation, and production, graph connectivity has thrived using the theory of complexity and algorithms in modern computer science. This is the first thorough book on this central notion in graph and network theory, and covers new concepts and algorithms for quicker and more efficient computing.
Автор: Edited by Lowell W. Beineke , Martin Charles Golum Название: Topics in Algorithmic Graph Theory ISBN: 1108492606 ISBN-13(EAN): 9781108492607 Издательство: Cambridge Academ Рейтинг: Цена: 95030.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Algorithmic graph theory has been expanding at an extremely rapid rate since the middle of the twentieth century, in parallel with the growth of computer science and the accompanying utilization of computers, where efficient algorithms have been a prime goal. This book presents material on developments on graph algorithms and related concepts that will be of value to both mathematicians and computer scientists, at a level suitable for graduate students, researchers and instructors. The fifteen expository chapters, written by acknowledged international experts on their subjects, focus on the application of algorithms to solve particular problems. All chapters were carefully edited to enhance readability and standardize the chapter structure as well as the terminology and notation. The editors provide basic background material in graph theory, and a chapter written by the book's Academic Consultant, Martin Charles Golumbic (University of Haifa, Israel), provides background material on algorithms as connected with graph theory.
Автор: Gibbons Название: Algorithmic Graph Theory ISBN: 0521288819 ISBN-13(EAN): 9780521288811 Издательство: Cambridge Academ Рейтинг: Цена: 45410.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Algorithm Graph Theory introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colourability, flows in networks, matching and transversals) and covers many of the classical theorems. Its emphasis is on algorithms and their complexity n which graph problems have known efficient solutions and which are intractable.
Автор: Pach, Janos Название: Combinatorial geometry and its algorithmic applications : the alcala lectures ISBN: 0821846914 ISBN-13(EAN): 9780821846919 Издательство: Mare Nostrum (Eurospan) Рейтинг: Цена: 87650.00 T Наличие на складе: Нет в наличии. Описание: The Ricci flow uses methods from analysis to study the geometry and topology of manifolds. With the third part of their volume on techniques and applications of the theory, the authors give a presentation of Hamilton`s Ricci flow for graduate students and mathematicians interested in working in the subject, with an emphasis on the geometric and analytic aspects.
Автор: Stanic, Zoran, Название: Regular Graphs A spectral Approach ISBN: 3110351285 ISBN-13(EAN): 9783110351286 Издательство: Walter de Gruyter Цена: 103550.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание:
Written for mathematicians working with the theory of graph spectra, this (primarily theoretical) book presents relevant results considering the spectral properties of regular graphs. The book begins with a short introduction including necessary terminology and notation. The author then proceeds with basic properties, specifi ed subclasses of regular graphs (like distance-regular graphs, strongly regular graphs, various designs or expanders) and determining particular regular graphs. Each chapter contains detailed proofs, discussions, comparisons, examples, exercises and also indicates possible applications. Finally, the author also includes some conjectures and open problems to promote further research.
Contents
Spectral properties
Particular types of regular graph
Determinations of regular graphs
Expanders
Distance matrix of regular graphs
Автор: Michel Chein; Marie-Laure Mugnier Название: Graph-based Knowledge Representation ISBN: 1848002858 ISBN-13(EAN): 9781848002852 Издательство: Springer Рейтинг: Цена: 130430.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: In addressing the question of how far it is possible to go in knowledge representation and reasoning through graphs, the authors cover basic conceptual graphs, computational aspects, and kernel extensions. The basic mathematical notions are summarized.
Автор: Bača Martin, Miller Mirka, Ryan Joe Название: Magic and Antimagic Graphs: Attributes, Observations and Challenges in Graph Labelings ISBN: 3030245845 ISBN-13(EAN): 9783030245849 Издательство: Springer Рейтинг: Цена: 130430.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: In addition, the book covers an assortment of variations on the labeling theme, all in one self-contained monograph.Assuming only basic familiarity with graphs, this book, complete with carefully written proofs of most results, is an ideal introduction to graph labeling for students learning the subject.
Автор: Mikhail Klin; Gareth A. Jones; Aleksandar Jurisic; Название: Algorithmic Algebraic Combinatorics and Gr?bner Bases ISBN: 3642424384 ISBN-13(EAN): 9783642424380 Издательство: Springer Рейтинг: Цена: 153720.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This collection of tutorial and research papers introduces readers to diverse areas of modern pure and applied algebraic combinatorics and finite geometries. There is special emphasis on algorithmic aspects and the use of the theory of Grobner bases.
Автор: Bang-Jensen Название: Classes of Directed Graphs ISBN: 3319718398 ISBN-13(EAN): 9783319718392 Издательство: Springer Рейтинг: Цена: 102480.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание:
This edited volume offers a detailed account of 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 comprehensive overview of the latest research in the field. It covers core new results on each of the classes discussed, including chapters on tournaments, planar digraphs, acyclic digraphs, Euler digraphs, graph products, directed width parameters, and algorithms. Detailed indices ease navigation while more than 120 open problems and conjectures ensure that readers are immersed in all aspects of the field.
Classes of Directed Graphs provides a valuable reference for graduate students and researchers in computer science, mathematics and operations research. As digraphs are an important modelling tool in other areas of research, this book will also be a useful resource to researchers working in bioinformatics, chemoinformatics, sociology, physics, medicine, etc.
Автор: Bounceur, Ahcene (universite De Bretagne Occidentale, Department Informatique) Bezoui, Madani Euler, Reinhardt (universite De Bretagne Occidentale, De Название: Boundaries and hulls of euclidean graphs ISBN: 1138048917 ISBN-13(EAN): 9781138048911 Издательство: Taylor&Francis Рейтинг: Цена: 117390.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Boundaries and Hulls of Euclidean Graphs: From Theory to Practice presents concepts and algorithms for finding convex, concave and polygon hulls of Euclidean graphs.
Автор: Martin Ba?a; Mirka Miller; Joe Ryan; Andrea Semani Название: Magic and Antimagic Graphs ISBN: 3030245810 ISBN-13(EAN): 9783030245818 Издательство: Springer Рейтинг: Цена: 130430.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: 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 and antimagic type labelings of undirected graphs. Long-standing problems are surveyed and presented along with recent results in classical labelings. In addition, the book covers an assortment of variations on the labeling theme, all in one self-contained monograph.Assuming only basic familiarity with graphs, this book, complete with carefully written proofs of most results, is an ideal introduction to graph labeling for students learning the subject. More than 150 open problems and conjectures make it an invaluable guide for postgraduate and early career researchers, as well as an excellent reference for established graph theorists.
Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2) ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz
