Автор: Dinh Название: Computing and Combinatorics ISBN: 3319426338 ISBN-13(EAN): 9783319426334 Издательство: Springer Рейтинг: Цена: 76400.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This book constitutes the refereed proceedings of the 22nd International Conference on Computing and Combinatorics, COCOON 2016, held in Ho Chi Minh City, Vietnam, in August 2016. The papers cover various topics including: Theory and Algorithms; Parameterized Complexity and Algorithms; Scheduling Algorithms and Circuit Complexity;
Автор: Takao Asano; Hiroshi Imai; D.T. Lee; Shin-ichi Nak Название: Computing and Combinatorics ISBN: 3540662006 ISBN-13(EAN): 9783540662006 Издательство: Springer Рейтинг: Цена: 83850.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This volume constitutes the proceedings of the 5th Annual International Conference on Computing and Combinatorics held in July 1999. The papers are organized in topical sections including data structures, computational biology, graph drawing, discrete mathematics and graph algorithms.
Автор: Tao Jiang; D.T. Lee Название: Computing and Combinatorics ISBN: 354063357X ISBN-13(EAN): 9783540633570 Издательство: Springer Рейтинг: Цена: 83850.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: The proceedings of the Third Annual International Conference on Computing and Combinatorics, COCOON `97. The papers in this volume are organized in sections which include parallel and distributed computing, computational geometry, complexity, computation biology, and computability.
Автор: Chartrand Gary Название: Graphs & Digraphs ISBN: 1498735762 ISBN-13(EAN): 9781498735766 Издательство: Taylor&Francis Рейтинг: Цена: 107190.00 T Наличие на складе: Нет в наличии. Описание:
Graphs & Digraphs masterfully employs student-friendly exposition, clear proofs, abundant examples, and numerous exercises to provide an essential understanding of the concepts, theorems, history, and applications of graph theory.
Fully updated and thoughtfully reorganized to make reading and locating material easier for instructors and students, the Sixth Edition of this bestselling, classroom-tested text:
Adds more than 160 new exercises
Presents many new concepts, theorems, and examples
Includes recent major contributions to long-standing conjectures such as the Hamiltonian Factorization Conjecture, 1-Factorization Conjecture, and Alspach's Conjecture on graph decompositions
Supplies a proof of the perfect graph theorem
Features a revised chapter on the probabilistic method in graph theory with many results integrated throughout the text
At the end of the book are indices and lists of mathematicians' names, terms, symbols, and useful references. There is also a section giving hints and solutions to all odd-numbered exercises. A complete solutions manual is available with qualifying course adoption.
Graphs & Digraphs, Sixth Edition remains the consummate text for an advanced undergraduate level or introductory graduate level course or two-semester sequence on graph theory, exploring the subject's fascinating history while covering a host of interesting problems and diverse applications.
Автор: Baik Jinho Название: Combinatorics and Random Matrix Theory ISBN: 0821848410 ISBN-13(EAN): 9780821848418 Издательство: Mare Nostrum (Eurospan) Рейтинг: Цена: 112860.00 T Наличие на складе: Нет в наличии. Описание: Over the last fifteen years a variety of problems in combinatorics has been solved in terms of random matrix theory. More precisely, the situation is as follows: the problems at hand are probabilistic in nature and, in an appropriate scaling limit, it turns out that certain key quantities associated with these problems behave statistically like the eigenvalues of a (large) random matrix. Said differently, random matrix theory provides a ``stochastic special function theory'' for a broad and growing class of problems in combinatorics. The goal of this book is to analyze in detail two key examples of this phenomenon, viz., Ulam's problem for increasing subsequences of random permutations and domino tilings of the Aztec diamond. Other examples are also described along the way, but in less detail.Techniques from many different areas in mathematics are needed to analyze these problems. These areas include combinatorics, probability theory, functional analysis, complex analysis, and the theory of integrable systems. The book is self-contained, and along the way we develop enough of the theory we need from each area that a general reader with, say, two or three years experience in graduate school can learn the subject directly from the text.
Автор: Oscar H. Ibarra; Louxin Zhang Название: Computing and Combinatorics ISBN: 354043996X ISBN-13(EAN): 9783540439967 Издательство: Springer Рейтинг: Цена: 107130.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: These are the refereed proceedings of the 8th Annual International Computing and Combinatorics Conference, COCOON 2002, held in Singapore in August 2002.
Автор: Ding-Zhu Du; Guochuan Zhang Название: Computing and Combinatorics ISBN: 3642387675 ISBN-13(EAN): 9783642387678 Издательство: Springer Рейтинг: Цена: 46570.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: There was a co-organized workshop on discrete algorithms of which 8 short papers were accepted and a workshop on computational social networks where 12 papers out of 25 submissions were accepted.
Автор: Jin-Yi Cai; C.K. Wong Название: Computing and Combinatorics ISBN: 3540613323 ISBN-13(EAN): 9783540613329 Издательство: Springer Рейтинг: Цена: 81050.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This volume constitutes the proceedings of the Second Annual International Conference on Computing and Combinatorics. The 44 papers, presented in revised version, describe current research results from various areas of theoretical computer science and combinatorics related to computing.
Автор: Yixin Cao; Jianer Chen Название: Computing and Combinatorics ISBN: 3319623885 ISBN-13(EAN): 9783319623887 Издательство: Springer Рейтинг: Цена: 83850.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: The papers cover various topics, including algorithms and data structures, complexity theory and computability, algorithmic game theory, computational learning theory, cryptography, computationalbiology, computational geometry and number theory, graph theory, and parallel and distributed computing.
Автор: Zhipeng Cai; Alexander Zelikovsky; Anu Bourgeois Название: Computing and Combinatorics ISBN: 3319087827 ISBN-13(EAN): 9783319087825 Издательство: Springer Рейтинг: Цена: 81990.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This book constitutes the refereed proceedings of the 20th International Conference on Computing and Combinatorics, COCOON 2014, held in Atlanta, GA, USA, in August 2014. There was a co-organized workshop on computational social networks (CSoNet 2014) where 8 papers were accepted. scheduling algorithms and circuit complexity and CSoNet.
Автор: Xiaodong Hu; Jie Wang Название: Computing and Combinatorics ISBN: 3540697322 ISBN-13(EAN): 9783540697329 Издательство: Springer Рейтинг: Цена: 107130.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Contains the refereed proceedings of the 14th Annual International Computing and Combinatorics Conference, COCOON 2008, held in Dalian, China, in June 2008. This work includes papers that are organized in topical sections on algorithms and data structures, algorithmic game theory and online algorithms, and computational biology and bioinformatics.
Автор: Hung Q. Ngo Название: Computing and Combinatorics ISBN: 3642028810 ISBN-13(EAN): 9783642028816 Издательство: Springer Рейтинг: Цена: 93160.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: 15th Annual International Conference COCOON 2009 Niagara Falls NY USA July 1315 2009 Proceedings. .
Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2) ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz
