Independence Theory in Combinatorics, V. Bryant

Автор: Harris, John Hirst, Jeffry L. Mossinghoff, Michael
Название: Combinatorics and graph theory
ISBN: 0387797106 ISBN-13(EAN): 9780387797106
Издательство: Springer
Рейтинг:
Цена: 38150.00 T
Наличие на складе: Есть в Астана (Нур-Султан)
Описание: 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.

Автор: Flajolet
Название: Analytic Combinatorics
ISBN: 0521898064 ISBN-13(EAN): 9780521898065
Издательство: Cambridge Academ
Рейтинг:
Цена: 88710.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The definitive treatment of analytic combinatorics. This self-contained text covers the mathematics underlying the analysis of discrete structures, with thorough treatment of a large number of applications. Exercises, examples, appendices and notes aid understanding: ideal for individual self-study or for advanced undergraduate or graduate courses.

Автор: Korte, Bernhard, Vygen, Jens
Название: Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.
ISBN: 3642244874 ISBN-13(EAN): 9783642244872
Издательство: Springer
Рейтинг:
Цена: 60510.00 T
Наличие на складе: Невозможна поставка.
Описание: 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.

Автор: Harris John M.
Название: Combinatorics and Graph Theory
ISBN: 1441927239 ISBN-13(EAN): 9781441927231
Издательство: Springer
Цена: 38150.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: There are certain rules that one must abide by in order to create a successful sequel. -- Randy Meeks, from the trailer to Scream 2 While we may not follow the precise rules that Mr. Meeks had in mind for s- cessful sequels, we have made a number of changes to the text in this second edition. In the new edition, we continue to introduce new topics with concrete - amples, we provide complete proofs of almost every result, and we preserve the book'sfriendlystyle andlivelypresentation, interspersingthetextwith occasional jokes and quotations. The rst two chapters, on graph theory and combinatorics, remain largely independent, and may be covered in either order. Chapter 3, on in nite combinatorics and graphs, may also be studied independently, although many readers will want to investigate trees, matchings, and Ramsey theory for nite sets before exploring these topics for in nite sets in the third chapter. Like the rst edition, this text is aimed at upper-division undergraduate students in mathematics, though others will nd much of interest as well. It assumes only familiarity with basic proof techniques, and some experience with matrices and in nite series. The second edition offersmany additionaltopics for use in the classroom or for independentstudy. Chapter 1 includesa new sectioncoveringdistance andrelated notions in graphs, following an expanded introductory section. This new section also introduces the adjacency matrix of a graph, and describes its connection to important features of the graph.

Автор: Jin Akiyama; William Y.C. Chen; Mikio Kano; Xuelia
Название: Discrete Geometry, Combinatorics and Graph Theory
ISBN: 3540706658 ISBN-13(EAN): 9783540706656
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.

Автор: S. B. Rao
Название: Combinatorics and Graph Theory
ISBN: 3540111514 ISBN-13(EAN): 9783540111511
Издательство: Springer
Рейтинг:
Цена: 46540.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: Bolian Liu; Hong-Jian Lai
Название: Matrices in Combinatorics and Graph Theory
ISBN: 1441948341 ISBN-13(EAN): 9781441948342
Издательство: Springer
Рейтинг:
Цена: 153720.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Combinatorics and Matrix Theory have a symbiotic, or mutually beneficial, relationship. where an attempt was made to give a broad picture of the use of combinatorial ideas in matrix theory and the use of matrix theory in proving theorems which, at least on the surface, are combinatorial in nature.

Автор: Martin Charles Golumbic; Irith Ben-Arroyo Hartman
Название: Graph Theory, Combinatorics and Algorithms
ISBN: 1441937234 ISBN-13(EAN): 9781441937230
Издательство: Springer
Рейтинг:
Цена: 121110.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering.

Автор: Frank G. Garvan; Mourad E.H. Ismail
Название: Symbolic Computation, Number Theory, Special Functions, Physics and Combinatorics
ISBN: 1461379644 ISBN-13(EAN): 9781461379645
Издательство: Springer
Рейтинг:
Цена: 130430.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: These are the proceedings of the conference "Symbolic Computation, Number Theory, Special Functions, Physics and Combinatorics" held at the Department of Mathematics, University of Florida, Gainesville, from November 11 to 13, 1999.

Автор: Fred Roberts
Название: Applications of Combinatorics and Graph Theory to the Biological and Social Sciences
ISBN: 1468463837 ISBN-13(EAN): 9781468463835
Издательство: Springer
Рейтинг:
Цена: 93160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This IMA Volume in Mathematics and its Applications Applications of Combinatorics and Graph Theory to the Biological and Social Sciences is based on the proceedings of a workshop which was an integral part of the 1987-88 IMA program on APPLIED COMBINATORICS.

Автор: Rainer Bodendiek; Rudolf Henn
Название: Topics in Combinatorics and Graph Theory
ISBN: 3642469108 ISBN-13(EAN): 9783642469107
Издательство: Springer
Рейтинг:
Цена: 93160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book, which grew out of contributions given by about 130 authors in honour to the 70th birthday of Gerhard Ringel, one of the pioneers in graph theory, is meant to serve as a source of open problems, reference and guide to the extensive literature and as stimulant to further research on graph theory and combinatorics.

Автор: Jaroslav Ne?et?il; Marco Pellegrini
Название: The Seventh European Conference on Combinatorics, Graph Theory and Applications
ISBN: 8876424741 ISBN-13(EAN): 9788876424748
Издательство: Springer
Рейтинг:
Цена: 26090.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Topics include, but are not limited to: Algebraic combinatorics, combinatorial geometry, combinatorial number theory, combinatorial optimization, designs and configurations, enumerative combinatorics, extremal combinatorics, ordered sets, random methods, topological combinatorics.