+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

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

Combinatorics and graph theory, Harris, John Hirst, Jeffry L. Mossinghoff, Michael

Combinatorics and graph theory

Автор: Harris, John Hirst, Jeffry L. Mossinghoff, Michael
Название:  Combinatorics and graph theory   (Комбинаторика и теория графов)
Издательство: Springer
Классификация:
Комбинаторика и теория графа

ISBN: 0387797106
ISBN-13(EAN): 9780387797106
ISBN: 0-387-79710-6
ISBN-13(EAN): 978-0-387-79710-6
Обложка/Формат: Hardback
Страницы: 397
Вес: 0.762 кг.
Дата издания: 01.09.2008
Серия: Undergraduate texts in mathematics
Язык: ENG
Издание: 2nd ed. 2008
Иллюстрации: 165 black & white illustrations, 10 black & white tables, 165 black & white line drawings
Размер: 23.62 x 15.75 x 2.29 cm
Читательская аудитория: Undergraduate
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание: Covers a wide variety of topics in combinatorics and graph theory. This book includes results and problems that cross subdisciplines, emphasizing relationships between different areas of mathematics. It also includes sections in graph theory on distance, Eulerian trails, and hamiltonian paths.

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

Отзывы покупателей.
Добавить отзыв.
Analytic Combinatorics

Автор: Flajolet
Название: Analytic Combinatorics
ISBN: 0521898064 ISBN-13(EAN): 9780521898065
Издательство: Cambridge Academ
Цена: 5434 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: The definitive treatment of analytic combinatorics, from leaders in the field. Exercises, examples, appendices and notes aid understanding.
Купить

Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.

Автор: Korte, Bernhard, Vygen, Jens
Название: Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.
ISBN: 3642244874 ISBN-13(EAN): 9783642244872
Издательство: Springer
Цена: 5001 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.
Купить

Algebraic Combinatorics / Lectures at a Summer School in Nordfjordeid, Norway, June 2003

Автор: Orlik Peter, Welker Volkmar, Floystad Gunnar
Название: Algebraic Combinatorics / Lectures at a Summer School in Nordfjordeid, Norway, June 2003
ISBN: 3540683755 ISBN-13(EAN): 9783540683759
Издательство: Springer
Цена: 3846 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: This book is based on two series of lectures given at a summer school on algebraic combinatorics at the Sophus Lie Centre in Nordfjordeid, Norway, in June 2003, one by Peter Orlik on hyperplane arrangements, and the other one by Volkmar Welker on free resolutions. Both topics are essential parts of current research in a variety of mathematical fields, and the present book makes these sophisticated tools available for graduate students.
Купить

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.

Купить

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 Theory, Combinatorics and Algorithms

Автор: Golumbic
Название: Graph Theory, Combinatorics and Algorithms
ISBN: 038724347X ISBN-13(EAN): 9780387243474
Издательство: Springer
Цена: 5925 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: Focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering. This book focuses on problems such as Internet congestion control, high-speed communication networks, multi-object auctions, resource allocation, and more.
Купить

Combinatorics and Graph Theory

Автор: Harris
Название: Combinatorics and Graph Theory
ISBN: 0387987363 ISBN-13(EAN): 9780387987361
Издательство: Springer
Цена: 3461 р.
Наличие на складе: Нет в наличии.
Описание: This book evolved from several courses in combinatorics and graph theory given at Appalachian State University and UCLA. Chapter 1 focuses on finite graph theory, including trees, planarity, coloring, matchings, and Ramsey theory. Chapter 2 studies combinatorics, including the principle of inclusion and exclusion, generating functions, recurrence relations, Polya theory, the stable marriage problem, and several important classes of numbers.

Chapter 3 presents infinite pigeonhole principles, Konig's lemma, and Ramsey's theorem, and discusses their connections to axiomatic set theory. The text is written in an enth siastic and lively style. It includes results and problems that cross subdisciplines, emphasizing relationships between different areas of mathematics.

In addition, recent results appear in the text, illustrating the fact that mathematics is a living discipline. The text is primarily directed toward upper-division undergraduate students, but lower-division undergraduates with a penchant for proof and graduate students seeking an introduction to these subjects will also find much of interest.

Купить

Discrete Geometry, Combinatorics and Graph Theory

Автор: Jin Akiyama; William Y.C. Chen; Mikio Kano; Xuelia
Название: Discrete Geometry, Combinatorics and Graph Theory
ISBN: 3540706658 ISBN-13(EAN): 9783540706656
Издательство: Springer
Цена: 5389 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: This book constitutes the thoroughly refereed post-proceedings of the 7th China-Japan Conference on Discrete Geometry, Combinatorics and Graph Theory, CJCDGCGT 2005, held in Tianjin, China, as well as in Xi`an, China, in November 2005. The 30 revised full papers address all current issues in discrete algorithmic geometry, combinatorics and graph theory.
Купить

HANDBOOK OF COMBINATORICS VOLUME 1,I

Автор: Author Unknown
Название: HANDBOOK OF COMBINATORICS VOLUME 1,I
ISBN: 0444823468 ISBN-13(EAN): 9780444823465
Издательство: Elsevier Science
Цена: 16555 р.
Наличие на складе: Поставка под заказ.
Описание: Covering important results and current trends and issues across the spectrum of combinatorics, this volume covers finite sets and relations, matroids, symmetric structures, and combinatorial structures in geometry and number theory.
Купить

Combinatorics, Automata and Number Theory

Автор: Berth?
Название: Combinatorics, Automata and Number Theory
ISBN: 0521515971 ISBN-13(EAN): 9780521515979
Издательство: Cambridge Academ
Цена: 8590 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: This collaborative volume presents trends arising from the fruitful interaction between the themes of combinatorics on words, automata and formal language theory, and number theory. Presenting several important tools and concepts, the authors also reveal some of the exciting and important relationships that exist between these different fields. Topics include numeration systems, word complexity function, morphic words, Rauzy tilings and substitutive dynamical systems, Bratelli diagrams, frequencies and ergodicity, Diophantine approximation and transcendence, asymptotic properties of digital functions, decidability issues for D0L systems, matrix products and joint spectral radius. Topics are presented in a way that links them to the three main themes, but also extends them to dynamical systems and ergodic theory, fractals, tilings and spectral properties of matrices. Graduate students, research mathematicians and computer scientists working in combinatorics, theory of computation, number theory, symbolic dynamics, fractals, tilings and stringology will find much of interest in this book.
Купить

The Andrews Festschrift / Seventeen Papers on Classical Number Theory and Combinatorics

Автор: Foata Dominique, Han Guo-Niu
Название: The Andrews Festschrift / Seventeen Papers on Classical Number Theory and Combinatorics
ISBN: 3540414916 ISBN-13(EAN): 9783540414919
Издательство: Springer
Цена: 6926 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: This book contains seventeen contributions made to George Andrews on the occasion of his sixtieth birthday, ranging from classical number theory (the theory of partitions) to classical and algebraic combinatorics. Most of the papers were read at the 42nd session of the SГ©minaire Lotharingien de Combinatoire that took place at Maratea, Basilicata, in August 1998.This volume contains a long memoir on Ramanujan's Unpublished Manuscript and the Tau functions studied with a contemporary eye, together with several papers dealing with the theory of partitions. There is also a description of a maple package to deal with general q-calculus. More subjects on algebraic combinatorics are developed, especially the theory of Kostka polynomials, the ice square model, the combinatorial theory of classical numbers, a new approach to determinant calculus.
Купить

Surveys in Combinatorics 2007

Автор: Edited by Anthony Hilton
Название: Surveys in Combinatorics 2007
ISBN: 0521698235 ISBN-13(EAN): 9780521698238
Издательство: Cambridge Academ
Цена: 4558 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: This volume contains survey articles based on the invited lectures given at the Twenty-first British Combinatorial Conference, held in July 2007 at the University of Reading. This biennial conference is a well-established international event and the articles are of the high quality that befits the event. By its nature this volume provides an up-to-date overview of current research activity in several areas of combinatorics, ranging from graph theory to current applications of combinatorial mathematics, including efficient approximability of NP-hard optimization problems and cryptographic key management. The authors are some of the world's foremost researchers in their fields, and here they summarize existing results, and give a unique preview of work currently being written up. The book provides a valuable survey of the present state of knowledge in combinatorics. It will be useful to research workers and advanced graduate students, primarily in mathematics but also in computer science, statistics and engineering.
Купить


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