+7(495) 980-12-10
  10:00-18:00 пн-сб
    shop@logobook.ru
   
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
Найти
  Зарубежные издательства Российские издательства  
   Авторы    Каталог книг    Издательства    Новинки    Учебная литература    Специальные предложения  Бестселлеры
 
 
Книги    
Logobook
Книги зарубежных издательств на иностранных языках
Logobook
Книги российских издательств
Logobook
Представительство в Казахстане
 
Вход в систему   
 
Войти
Регистрация  Забыли?
 
Информация   
Контакты/Адрес/Проезд
Корзина
Ваши заказы
Доставка и Оплата
Заказ по телефону/email
Помощь
Есть вопрос?
О компании
Политика конфиденциальности
LgBook.ru
FkBook.ru
 
Online Каталоги   
Cambridge University Press
Каталог учебной литературы
по английскому языку >>>

Oxford University Press
Каталог учебной литературы
по английскому языку >>>



Каталог учебной литературы
по английскому языку >>>

Pearson ELT

Читайте отзывы покупателей и оценивайте качество магазина на Яндекс.Маркете

Algorithmic aspects of graph connectivity, Nagamochi, Hiroshi Ibaraki, Toshihide

Algorithmic aspects of graph connectivity

Автор: Nagamochi, Hiroshi Ibaraki, Toshihide
Название:  Algorithmic aspects of graph connectivity   (Алгоритмические аспекты связности графов)
Издательство: Cambridge Academ
Классификация:
Комбинаторика и теория графа

ISBN: 0521878640
ISBN-13(EAN): 9780521878647
ISBN: 0-521-87864-0
ISBN-13(EAN): 978-0-521-87864-7
Обложка/Формат: Hardback
Страницы: 392
Вес: 0.72 кг.
Дата издания: 08.09.2008
Серия: Encyclopedia of mathematics and its applications
Язык: ENG
Иллюстрации: 119 line diagrams 1 table
Размер: 23.37 x 16.00 x 3.30 cm
Читательская аудитория: Tertiary education (us: college)
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Англии
Описание: 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 algorithmic progress under the influence of the theory of complexity and algorithms in modern computer science. The book contains various definitions of connectivity, including edge-connectivity and vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts. The authors thoroughly discuss new concepts and algorithms that allow for quicker and more efficient computing, such as maximum adjacency ordering of vertices. Covering both basic definitions and advanced topics, this book can be used as a textbook in graduate courses in mathematical sciences, such as discrete mathematics, combinatorics, and operations research, and as a reference book for specialists in discrete mathematics and its applications.
Описание: The first really thorough book to discuss this central notion in graph and network theory, emphasising its algorithmic aspects.
Дополнительное описание:

Добавить в Мои желания

 Варианты приобретения 
  Кол-во Наличие на складе Цена р. Купить / Отложить
1 Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Америка: 148шт.  
При оформлении заказа до: 20 окт 2017
Ориентировочная дата поставки: cередина Ноября
При условии наличия книги у поставщика.
6311.00
Добавить в корзину

Отзывы покупателей.
Добавить отзыв.
Algebraic Graph Theory

Автор: Godsil Chris, Royle Gordon F.
Название: Algebraic Graph Theory
ISBN: 0387952411 ISBN-13(EAN): 9780387952413
Издательство: Springer
Цена: 6233 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.

в Мои желания
Handbook of Graph Theory, Second Edition

Автор: Gross
Название: Handbook of Graph Theory, Second Edition
ISBN: 1439880182 ISBN-13(EAN): 9781439880180
Издательство: Taylor&Francis
Цена: 8800 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.

в Мои желания
Introduction to graph theory: h3 mathematics

Название: Introduction to graph theory: h3 mathematics
ISBN: 9812705252 ISBN-13(EAN): 9789812705259
Издательство: World Scientific Publishing
Цена: 11248 р.
Наличие на складе: Поставка под заказ.

Описание: 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)

Название: Walk through combinatorics, a: an introduction to enumeration and graph theory (2nd edition)
ISBN: 9812568859 ISBN-13(EAN): 9789812568854
Издательство: World Scientific Publishing
Цена: 5726 р.
Наличие на складе: Поставка под заказ.

Описание: 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-theoretic techniques for web content mining

Название: Graph-theoretic techniques for web content mining
ISBN: 9812563393 ISBN-13(EAN): 9789812563392
Издательство: World Scientific Publishing
Цена: 14111 р.
Наличие на складе: Поставка под заказ.

Описание: This book describes exciting new opportunities for utilizing robust graph representations of data with common machine learning algorithms. Graphs can model additional information which is often not present in commonly used data representations, such as vectors. Through the use of graph distance - a relatively new approach for determining graph similarity - the authors show how well-known algorithms, such as k-means clustering and k-nearest neighbors classification, can be easily extended to work with graphs instead of vectors. This allows for the utilization of additional information found in graph representations, while at the same time employing well-known, proven algorithms.To demonstrate and investigate these novel techniques, the authors have selected the domain of web content mining, which involves the clustering and classification of web documents based on their textual substance. Several methods of representing web document content by graphs are introduced; an interesting feature of these representations is that they allow for a polynomial time distance computation, something which is typically an NP-complete problem when using graphs. Experimental results are reported for both clustering and classification in three web document collections using a variety of graph representations, distance measures, and algorithm parameters.In addition, this book describes several other related topics, many of which provide excellent starting points for researchers and students interested in exploring this new area of machine learning further. These topics include creating graph-based multiple classifier ensembles through random node selection and visualization of graph-based data using multidimensional scaling.

в Мои желания
Introduction to graph theory: h3 mathematics

Название: Introduction to graph theory: h3 mathematics
ISBN: 9812703861 ISBN-13(EAN): 9789812703866
Издательство: World Scientific Publishing
Цена: 7056 р.
Наличие на складе: Поставка под заказ.

Описание: 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)

Название: Walk through combinatorics, a: an introduction to enumeration and graph theory (2nd edition)
ISBN: 9812568867 ISBN-13(EAN): 9789812568861
Издательство: World Scientific Publishing
Цена: 3272 р.
Наличие на складе: Поставка под заказ.

Описание: 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 3

Название: Graph algorithms and applications 3
ISBN: 9812389393 ISBN-13(EAN): 9789812389398
Издательство: World Scientific Publishing
Цена: 8692 р.
Наличие на складе: Поставка под заказ.

Описание: This book contains Volume 6 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 3 presents contributions from prominent authors and includes selected papers from the Symposium on Graph Drawing (1999 and 2). 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 5

Название: Graph algorithms and applications 5
ISBN: 981256845X ISBN-13(EAN): 9789812568458
Издательство: World Scientific Publishing
Цена: 11555 р.
Наличие на складе: Поставка под заказ.

Описание: 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

Название: Graph algorithms and applications 4
ISBN: 9812568441 ISBN-13(EAN): 9789812568441
Издательство: World Scientific Publishing
Цена: 11555 р.
Наличие на складе: Поставка под заказ.

Описание: 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.

в Мои желания
Algorithmic Graph Theory and Perfect Graphs,57

Автор: Martin Charles Golumbic
Название: Algorithmic Graph Theory and Perfect Graphs,57
ISBN: 0444515305 ISBN-13(EAN): 9780444515308
Издательство: Elsevier Science
Цена: 5155 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.

Описание: Conveys the message that intersection graph models are a necessary and important tool for solving real-world problems. This edition includes an Epilogue chapter, which covers topics such as the theory and applications of intersection graph models such as generalizations of permutation graphs and interval graphs.

в Мои желания
Information and Randomness / An Algorithmic Perspective

Автор: Calude Cristian S.
Название: Information and Randomness / An Algorithmic Perspective
ISBN: 3540434666 ISBN-13(EAN): 9783540434665
Издательство: Springer
Цена: 5386 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.

Описание: The book presents in a mathematical clear way the fundamentals of algorithmic information theory and a few selected applications. This 2nd edition presents new and important results obtained in recent years: the characterization of computable enumerable random reals, the construction of an Omega Number for which ZFC cannot determine any digits, and the first successful attempt to compute the exact values of 64 bits of a specific Omega Number. Finally, the book contains a discussion of some interesting philosophical questions related to randomness and mathematical knowledge. "Professor Calude has produced a first-rate exposition of up-to-date work in information and randomness." D.S. Bridges, Canterbury University, co-author, with Errett Bishop, of Constructive Analysis;"The second edition of this classic work is highly recommended to anyone interested in algorithmic information and randomness." G.J. Chaitin, IBM Research Division, New York, author of Conversations with a Mathematician; "This book is a must for a comprehensive introduction to algorithmic information theory and for anyone interested in its applications in the natural sciences." K. Svozil, Technical University of Vienna, author of Randomness & Undecidability in Physics

в Мои желания

 
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
Visa, Master Card, Diners, AMEX, JCB, Web Money, Yandex Money Сбербанк онлайн