Поиск книг                    Поиск по списку 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
Обложка/Формат: Hardcover
Страницы: 392
Вес: 0.691 кг.
Дата издания: 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 Отсутствует. Возможна поставка под заказ.
При оформлении заказа до: 7 апр 2017
Ориентировочная дата поставки: 2 май 2017
При условии наличия книги у поставщика.
6311.00
 о цене
Добавить в корзину
Add to Wish list

Отзывы покупателей.
Добавить отзыв.
Probabilistic Methods for Algorithmic Discrete Mathematics

Автор: Habib
Название: Probabilistic Methods for Algorithmic Discrete Mathematics
ISBN: 3540646221 ISBN-13(EAN): 9783540646228
Издательство: Springer
Цена: 10007 р.
Наличие на складе: Нет в наличии.
Описание: 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.
Купить

Recent Advances in Algorithmic Combinatorics

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

Information and Randomness / An Algorithmic Perspective

Автор: Calude Cristian S.
Название: Information and Randomness / An Algorithmic Perspective
ISBN: 3540434666 ISBN-13(EAN): 9783540434665
Издательство: Springer
Цена: 5387 р.
Наличие на складе: Нет в наличии.
Описание: 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
Купить

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
Цена: 5772 р.
Наличие на складе: Нет в наличии.
Описание: 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.
Купить

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
Цена: 4617 р.
Наличие на складе: Поставка под заказ.
Описание: 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.
Купить

Algorithmic Algebraic Combinatorics and Gr?bner Bases

Автор: Klin
Название: Algorithmic Algebraic Combinatorics and Gr?bner Bases
ISBN: 3642019595 ISBN-13(EAN): 9783642019593
Издательство: Springer
Цена: 8467 р.
Наличие на складе: Нет в наличии.
Описание: 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.
Купить

Mathematical Aspects of Spin Glasses and Neural Networks

Автор: Bovier Anton, Picco Pierre
Название: Mathematical Aspects of Spin Glasses and Neural Networks
ISBN: 0817638636 ISBN-13(EAN): 9780817638634
Издательство: Birkhauser Verlag AG
Цена: 14375 р.
Наличие на складе: Нет в наличии.
Описание: Aimed at graduates and potential researchers, this is a comprehensive introduction to the mathematical aspects of spin glasses and neural networks. It should be useful to mathematicians in probability theory and theoretical physics, and to engineers working in theoretical computer science.
Купить

Aspects of Semidefinite Programming / Interior Point Algorithms and Selected Applications

Автор: de Klerk E.
Название: Aspects of Semidefinite Programming / Interior Point Algorithms and Selected Applications
ISBN: 1402005474 ISBN-13(EAN): 9781402005473
Издательство: Springer
Цена: 10546 р.
Наличие на складе: Нет в наличии.
Описание: Semidefinite programming has been described as linear programming for the year 2000. It is an exciting new branch of mathematical programming, due to important applications in control theory, combinatorial optimization and other fields. Moreover, the successful interior point algorithms for linear programming can be extended to semidefinite programming.In this monograph the basic theory of interior point algorithms is explained. This includes the latest results on the properties of the central path as well as the analysis of the most important classes of algorithms. Several "classic" applications of semidefinite programming are also described in detail. These include the LovГЎsz theta function and the MAX-CUT approximation algorithm by Goemans and Williamson. Audience: Researchers or graduate students in optimization or related fields, who wish to learn more about the theory and applications of semidefinite programming.
Купить


 
ООО "Логосфера " Тел:(495) 748-51-16 Факс: (495) 689-73-83 доб.116 www.logobook.ru
Visa, Master Card, Diners, AMEX, JCB, Web Money, Yandex Money Сбербанк онлайн