+7(495) 980-12-10
  10:00-18:00 пн-сб
  shop@logobook.ru
   
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
Найти
  Зарубежные издательства Российские издательства  
  Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Специальные предложения | Бестселлеры
 
 
Книги
Книги зарубежных издательств на иностранных языках

Книги российских издательств

Представительство в Казахстане
 
Вход в систему
 
Войти
Регистрация  Забыли?
 
Информация
Контакты/Адрес/Проезд
Корзина
Ваши заказы
Доставка и Оплата
Заказ по телефону/email
Помощь
Есть вопрос?
О компании
Политика конфиденциальности
LgBook.ru
FkBook.ru
 
Online Каталоги
Каталог учебной литературы
по английскому языку >>>

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


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 Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Англия: 379шт.  Склад Америка: 148шт.  
При оформлении заказа до:
Ориентировочная дата поставки:
6311.00
Добавить в корзину


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.

в Мои желания
The Algorithmic Beauty of Seaweeds, Sponges and Corals

Автор: Kaandorp Jaap A., KГјbler Janet E.
Название: The Algorithmic Beauty of Seaweeds, Sponges and Corals
ISBN: 3540677003 ISBN-13(EAN): 9783540677000
Издательство: Springer
Рейтинг:
Цена: 10009 р.
Наличие на складе: Нет в наличии.

Описание: This book gives a state-of-the-art overview of modeling growth and form of marine sessile organisms - such as stromatolites, algae, and metazoans including stony corals, hydrocorals, octocorals, and sponges -, using large-scale computing techniques, scientific visualization, methods for analyzing 2D and 3D forms, and particle-based modeling techniques. It originates from the workshop on Modeling Growth and Form of Marine Sessile Organisms, held at the National Center for Ecological Analysis and Synthesis, Santa Barbara, California, August 1999. Experts from various disciplines including developmental biology, ecology, computer science, physics and mathematics, who have research interests in modeling the development of these organisms have been invited to contribute. The book describes all the steps required to develop and experimentally validate morphological models including collecting biological information and methods for specifying and comparing forms. Examples are given of how models are currently being applied to simulate growth and form of marine sessile organisms. Potential applications of growth models and morphological analyses in modern and paleo-bio-monitoring, the detection of environmental change, and the conservation and restoration of marine ecosystems and aquaculture are addressed. The combination of simulation models with laboratory and field experiments provides a powerful tool to obtain insights on how the growth forms of marine organisms emerge from physical, genetic and environmental influences.

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

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

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

в Мои желания
Algebraic Graph Theory

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

в Мои желания
Algorithmic Graph Theory

Автор: Gibbons
Название: Algorithmic Graph Theory
ISBN: 0521288819 ISBN-13(EAN): 9780521288811
Издательство: Cambridge Academ
Рейтинг:
Цена: 3067 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

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

в Мои желания
Generalized Connectivity of Graphs

Автор: Li
Название: Generalized Connectivity of Graphs
ISBN: 3319338277 ISBN-13(EAN): 9783319338279
Издательство: Springer
Рейтинг:
Цена: 3849 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

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

в Мои желания
Probabilistic Methods for Algorithmic Discrete Mathematics

Автор: Habib
Название: Probabilistic Methods for Algorithmic Discrete Mathematics
ISBN: 3540646221 ISBN-13(EAN): 9783540646228
Издательство: Springer
Рейтинг:
Цена: 12704 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

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

в Мои желания
Algorithmic Algebraic Combinatorics and Gr?bner Bases

Автор: Klin
Название: Algorithmic Algebraic Combinatorics and Gr?bner Bases
ISBN: 3642019595 ISBN-13(EAN): 9783642019593
Издательство: Springer
Рейтинг:
Цена: 12704 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

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

в Мои желания
Recent Advances in Algorithmic Combinatorics

Автор: Reed Bruce A., Linhares-Sales Claudia L.
Название: Recent Advances in Algorithmic Combinatorics
ISBN: 0387954341 ISBN-13(EAN): 9780387954349
Издательство: Springer
Рейтинг:
Цена: 14629 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

в Мои желания
Recombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks

Автор: Gusfield Dan, Gusfield Daniel M.
Название: Recombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks
ISBN: 0262027526 ISBN-13(EAN): 9780262027526
Издательство: Wiley
Рейтинг:
Цена: 3692 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

в Мои желания
Introduction to graph theory: solutions manual

Название: Introduction to graph theory: solutions manual
ISBN: 9812771751 ISBN-13(EAN): 9789812771759
Издательство: World Scientific Publishing
Рейтинг:
Цена: 5829 р.
Наличие на складе: Нет в наличии.

Описание: This is a companion to the book "Introduction to Graph Theory" (World Scientific, 2006). The student who has worked on the problems will find the solutions presented useful as a check and also as a model for rigorous mathematical writing. For ease of reference, each chapter recaps some of the important concepts and/or formulae from the earlier book.

в Мои желания
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.

в Мои желания

ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
Мобильная версия : : : : : : : : : : : : : : : : : : : :