Kategoria BISAC: Mathematics >> Combinatorics

This volume surveys the development of combinatorics since 1930 by presenting in chronological order the fundamental results of the subject proved in over five decades of original papers by: T. van Aardenne-Ehrenfest.- R.L. Brooks.- N.G. de Bruijn.- G.F. Clements.- H.H. Crapo.- R.P. Dilworth.- J. Edmonds.- P. Erdos.- L.R. Ford, Jr.- D.R. Fulkerson.- D. Gale.- L. Geissinger.- I.J. Good.- R.L. Graham.- A.W. Hales.- P. Hall.- P.R. Halmos.- R.I. Jewett.- I. Kaplansky.- P.W. Kasteleyn.- G. Katona.- D.J. Kleitman.- K. Leeb.- B. Lindstrom.- L. Lovasz.- D. Lubell.- C. St. J.A. Nash-Williams.- G....

Discrete mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is LAszlA3 LovAsz, a scholar whose outstanding scientific work has defined and shaped many research directions in the last 40 years. A number of friends and colleagues, all top authorities in their fields of expertise and all invited plenary speakers at one of two conferences in...

Additive combinatorics is a relatively recent term coined to comprehend the developments of the more classical additive number theory, mainly focussed on problems related to the addition of integers. Some classical problems like the Waring problem on the sum of k-th powers or the Goldbach conjecture are genuine examples of the original questions addressed in the area. One of the features of contemporary additive combinatorics is the interplay of a great variety of mathematical techniques, including combinatorics, harmonic analysis, convex geometry, graph theory, probability theory,...

The fusion between graph theory and combinatorial optimization has led to theoretically profound and practically useful algorithms, yet there is no book that currently covers both areas together. Handbook of Graph Theory, Combinatorial Optimization, and Algorithms is the first to present a unified, comprehensive treatment of both graph theory and combinatorial optimization.

Divided into 11 cohesive sections, the handbook s 44 chapters focus on graph theory, combinatorial optimization, and algorithmic issues. The book provides readers with the algorithmic and...

Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and Applications

The Handbook of Graph Drawing and Visualization provides a broad, up-to-date survey of the field of graph drawing. It covers topological and geometric foundations, algorithms, software systems, and visualization applications in business, education, science, and engineering. Each chapter is self-contained and includes extensive references.

The first several chapters of the book deal with fundamental topological and geometric concepts and...

A One-Stop Source of Known Results, a Bibliography of Papers on the Subject, and Novel Research Directions

Focusing on a very active area of research in the last decade, Combinatorics of Compositions and Words provides an introduction to the methods used in the combinatorics of pattern avoidance and pattern enumeration in compositions and words. It also presents various tools and approaches that are applicable to other areas of enumerative combinatorics.

After a historical perspective on research in the area, the text introduces techniques...

The algorithms considered are the basic and traditional algorithms of computer science, such as Greedy, Dynamic and Divide & Conquer. In addition, two classes of algorithms that rarely make it into introductory textbooks are...