Автор: Chartrand, Gary Lesniak, Linda Zhang, Ping Название: Graphs & digraphs, fifth edition ISBN: 1439826277 ISBN-13(EAN): 9781439826270 Издательство: Taylor&Francis Цена: 5955 р. Наличие на складе: Поставка под заказ. Описание:
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 new topics.
New to the Fifth Edition
New or expanded coverage of graph minors, perfect graphs, chromatic polynomials, nowhere-zero flows, flows in networks, degree sequences, toughness, list colorings, and list edge colorings
New examples, figures, and applications to illustrate concepts and theorems
Expanded historical discussions of well-known mathematicians and problems
More than 300 new exercises, along with hints and solutions to odd-numbered exercises at the back of the book
Reorganization of sections into subsections to make the material easier to read
Bolded definitions of terms, making them easier to locate
Despite a field that has evolved over the years, this student-friendly, classroom-tested text remains the consummate introduction to graph theory. It explores the subject 's fascinating history and presents a host of interesting problems and diverse applications.
Автор: Chartrand, Gary Lesniak, Linda Zhang, Ping Название: Graphs & digraphs, fifth edition ISBN: 1439826277 ISBN-13(EAN): 9781439826270 Издательство: Taylor&Francis Рейтинг: Цена: 5955 р. Наличие на складе: Поставка под заказ.
Описание:
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 new topics.
New to the Fifth Edition
New or expanded coverage of graph minors, perfect graphs, chromatic polynomials, nowhere-zero flows, flows in networks, degree sequences, toughness, list colorings, and list edge colorings
New examples, figures, and applications to illustrate concepts and theorems
Expanded historical discussions of well-known mathematicians and problems
More than 300 new exercises, along with hints and solutions to odd-numbered exercises at the back of the book
Reorganization of sections into subsections to make the material easier to read
Bolded definitions of terms, making them easier to locate
Despite a field that has evolved over the years, this student-friendly, classroom-tested text remains the consummate introduction to graph theory. It explores the subject 's fascinating history and presents a host of interesting problems and diverse applications.
Автор: Jungnickel Название: Graphs, Networks and Algorithms ISBN: 3540727795 ISBN-13(EAN): 9783540727798 Издательство: Springer Рейтинг: Цена: 6073 р. Наличие на складе: Поставка под заказ.
Описание: From 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 author finds a striking synthesis of nice and interesting mathematical results and practical applications. ... the author pays much attention to the inclusion of well-chosen exercises. The reader does not remain helpless; solutions or at least hints are given in the appendix. Except for some small basic mathematical and algorithmic knowledge the book is self-contained. ...” (K. Engel, Mathematical Reviews (2002) “The substantial development effort of this text, involving multiple editions and trailing in the context of various workshops, university courses and seminar series, clearly shows through in this new edition with its clear writing, good organisation, comprehensive coverage of essential theory, and well-chosen applications. The proofs of important results and the representation of key algorithms in a Pascal-like notation allow this book to be used in a high-level undergraduate or low-level graduate course on graph theory, combinatorial optimization or computer science algorithms. The well-worked solutions to exercises are a real bonus for self study by students. The book is highly recommended.” (P.B. Gibbons, Zentralblatt fГјr Mathematik 1061, 2005)The third edition of this standard textbook contains additional material: two new application sections (on graphical codes and their decoding) and about two dozen further exercises (with solutions, as throughout the text). Moreover, recent developments have been discussed and referenced, in particular for the travelling salesman problem. The presentation has been improved in many places (for instance, in the chapters on shortest paths and on colorings), and a number of proofs have been reorganized, making them more precise or more transparent.
Описание: Bondgraphs are a well-established technique for the modelling of complex engineering systems. The subject of this book is an integrated modelling and simulation of mechatronics systems in a visual computer environment. The modelling is based on system top-down and bottom-up approach. The mathematical models are generated in a form of differential-algebraic equations and solved using numerical and symbolic algebra methods. The authors carefully explain a systematic procedure for developing the models using simple visual commands and construct a bondgraph at every level of decomposition. The integrated approach they develop is applied to mechanical, electrical and control systems, multibody dynamics, and continuous systems. The book contains a powerful computer simulation package on the accompanying CD-ROM. The BondSim package supports top-down and bottom-up model development using component libraries.
Автор: Valiente Gabriel Название: Algorithms on Trees and Graphs ISBN: 3540435506 ISBN-13(EAN): 9783540435501 Издательство: Springer Рейтинг: Цена: 6264 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: From their first local hit, "Buttered Popcorn" with Florence Ballard singing lead with the The Primettes, the Supremes would go on to become the most popular female signing group of all time. When "Dream Girl" and "Supreme Faith" were first published, it caused a sensation - this is the story. Introduces graph algorithms on an intuitive basis followed by an exposition in a literate programming style, with correctness proofs as well as worst-case analyses. This book provides C++ implementations of algorithms using the LEDA library of data structures and algorithms.
Автор: Kaufmann Michael, Wagner Dorothea Название: Drawing Graphs / Methods and Models ISBN: 3540420622 ISBN-13(EAN): 9783540420620 Издательство: Springer Рейтинг: Цена: 6540 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: Bang-Jensen Jorgen, Gutin Gregory Название: Digraphs / Theory, Algorithms and Applications ISBN: 1852332689 ISBN-13(EAN): 9781852332686 Издательство: Springer Цена: 9345 р. Наличие на складе: Поставка под заказ.
Описание: The study of directed graphs has developed enormously over recent decades, yet no book covers more than a tiny fraction of the results from more than 3000 research articles on the topic. Digraphs is the first book to present a unified and comprehensive survey of the subject. In addition to covering the theoretical aspects, including detailed proofs of many important results, the authors present a number of algorithms and applications. The applications of digraphs and their generalizations include among other things recent developments in the Travelling Salesman Problem, genetics and network connectivity. More than 700 exercises and 180 figures will help readers to study the topic while open problems and conjectures will inspire further research.This book will be essential reading and reference for all graduate students, researchers and professionals in mathematics, operational research, computer science and other areas who are interested in graph theory and its applications.
Автор: Bang-Jensen Jorgen, Gutin Gregory Название: Digraphs / Theory, Algorithms and Applications ISBN: 1852336110 ISBN-13(EAN): 9781852336110 Издательство: Springer Рейтинг: Цена: 5605 р. Наличие на складе: Поставка под заказ.
Описание: The study of directed graphs has developed enormously over recent decades, yet no book covers more than a tiny fraction of the results from more than 3000 research articles on the topic. Digraphs is the first book to present a unified and comprehensive survey of the subject. In addition to covering the theoretical aspects, including detailed proofs of many important results, the authors present a number of algorithms and applications. The applications of digraphs and their generalizations include among other things recent developments in the Travelling Salesman Problem, genetics and network connectivity. More than 700 exercises and 180 figures will help readers to study the topic while open problems and conjectures will inspire further research.This book will be essential reading and reference for all graduate students, researchers and professionals in mathematics, operational research, computer science and other areas who are interested in graph theory and its applications.
Автор: J?rgen Bang-Jensen; Gregory Z. Gutin Название: Digraphs ISBN: 1848009976 ISBN-13(EAN): 9781848009974 Издательство: Springer Рейтинг: Цена: 9349 р. Наличие на складе: Поставка под заказ.
Описание: Presents a number of algorithms, and includes chapters devoted to topics such as branchings, feedback arc and vertex sets, connectivity augmentations, sparse subdigraphs with prescribed connectivity. This book focuses on applications which include quantum mechanics, bioinformatics, embedded computing, and the travelling salesman problem.
Автор: Bang-jensen, Jorgen Gutin, Gregory Название: Digraphs ISBN: 085729041X ISBN-13(EAN): 9780857290410 Издательство: Springer Рейтинг: Цена: 7947 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The new edition of this first book devoted to directed graphs has been substantially revised, reorganized and updated. With a strong focus on applications, it contains many new results and more than 650 exercises, 170 figures and 150 open problems.
Описание: Discrete mathematics, including (combinatorial) number theory and set theory has always been a stronghold of Hungarian mathematics. The present volume honouring Vera Sos and Andras Hajnal contains survey articles (with classical theorems and state-of-the-art results) and cutting edge expository research papers with new theorems and proofs in the area of the classical Hungarian subjects, like extremal combinatorics, colorings, combinatorial number theory, etc. The open problems and the latest results in the papers inspire further research. The volume is recommended to experienced specialists as well as to young researchers and students.
Автор: Hora Akihito, Obata Nobuaki, Accardi L. Название: Quantum Probability and Spectral Analysis of Graphs ISBN: 3540488626 ISBN-13(EAN): 9783540488620 Издательство: Springer Рейтинг: Цена: 10748 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This is the first book to comprehensively cover the quantum probabilistic approach to spectral analysis of graphs. This approach has been developed by the authors and has become an interesting research area in applied mathematics and physics. The book can be used as a concise introduction to quantum probability from an algebraic aspect. Here readers will learn several powerful methods and techniques of wide applicability, which have been recently developed under the name of quantum probability. The exercises at the end of each chapter help to deepen understanding. Among the topics discussed along the way are: quantum probability and orthogonal polynomials; asymptotic spectral theory (quantum central limit theorems) for adjacency matrices; the method of quantum decomposition; notions of independence and structure of graphs; and asymptotic representation theory of the symmetric groups.
Автор: Jensen Название: Bayesian Networks and Decision Graphs ISBN: 0387682813 ISBN-13(EAN): 9780387682815 Издательство: Springer Рейтинг: Цена: 9349 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This is a new edition of an essential work on Bayesian networks and decision graphs. It is an introduction to probabilistic graphical models including Bayesian networks and influence diagrams. It presents a thorough introduction to state-of-the-art solution and analysis algorithms.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
В Контакте
Мобильная версия