Nijenhuis A., Wilf H.S. Combinatorial Algorithms for Computers and Calculators

формат pdf
размер 5.37 МБ
добавлен 04 октября 2011 г.

Издательство Academic Press, 1978, -316 pp.
Описан набор эффективных по скорости и памяти комбинаторных алгоритмов. Содержит подробное описание алгоритмов и код на Фортране.
Combinatorial families.
Next Subset of an n-Set.
Random Subset of an n-Set.
Next k-Subset of an n-Set.
Random k-Subset of an n-Set.
Next Composition of n into k Parts.
Random Composition of n into k Parts.
Next Permutation of n Letters.
Random Permutation of n Letters.
Next Partition of Integer n.
Random Partition of Integer n.
Next Partition of n-Set.
Random Partition of n-Set.
Sequencing, Ranking and Selection Algorithms in General Combinatorial Families.
Young Tableaux.
Combinatorial Structures.
Sorting.
The Cycle Structure of Permutation.
Renumbering Rows and Columns of an Array.
Spanning Forest of a Graph.
Newton Forms of Polinomial.
Chromatic Polinomial of a Graf.
Composition of Power Series.
Network Flows.
The Permanent Function.
nvert a Triangular Array.
Triangular Numbering of a Partially Ordered Set.
The M?bius Function.
The Backtrack Method.
Labeled Trees.
Random Unlabeled Rooted Trees.
Tree of Minimal Length.

Смотрите также

Berge C. Principles of Combinatorics

формат pdf
размер 2 МБ
добавлен 23 июля 2011 г.

Acаdemic Prеss, 1971. - 176 pages. Most mathematicians of this day, confronted with an argument requiring combinatorial thinking, react with one of two stock phrases: (a) This is a purely combinatorial argument, (b) This is a difficult combinatorial argument. Hypnotic repetition of either of these slogans is likely to have the same balming effect on the speaker: freed from all scruples, he will pass the buck and unload the work onto someone else...

Edelsbrunner H. Algorithms in Combinatorial Geometry

формат djvu
размер 4.52 МБ
добавлен 15 октября 2011 г.

Издательство Springer, 1987, -439 pp. Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most eff...

Golumbic M.C., Hartman I.B.-A. Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications

формат pdf
размер 10.29 МБ
добавлен 12 декабря 2010 г.

Sprіnger, 2005. - 301 pages. 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. The book contains eleven chapters written by experts in their respective fields, and covers a wide spectrum of high-interest problems across these discipline domains. A...

Gr?tschel M., Lov?sz L., Schrijver A. Geometric Algorithms and Combinatorial Optimization

формат djvu
размер 4.04 МБ
добавлен 04 октября 2011 г.

Издательство Springer, 1988, -379 pp. Historically, there is a close connection between geometry and optimization. This is illustrated by methods Like the gradient method and the simplex method, which are associated with clear geometric pictures. In combinatorial optimization, however, many of the strongest and most frequently used algorithms are based on the discrete structure of the problems: the greedy algorithm, shortest path and alternating...

Jungnickel D. Graphs, Networks and Algorithms

формат pdf
размер 5.24 МБ
добавлен 04 января 2011 г.

Springer, 2007. - 650 pages. Combinatorial optimization, along with graph algorithms and complexity theory is booming. This book treats the most prominent problems which are polynomially solvable. The Traveling Salesman Problem is discussed as a paradigm of an NP-complete problem. The text is well written, most exercises are quite enlightening and the hints are clear. Algorithms are described very thoroughly. The list of references is impressive...

Kaski P., ?sterg?rd P.R.J. Classification Algorithms for Codes and Designs

формат pdf
размер 1.99 МБ
добавлен 05 декабря 2011 г.

Издательство Springer, 2006, -413 pp. The history of classifying combinatorial objects is as old as the history of the objects themselves. In the mid-19th century, Kirkman, Steiner, and others became the fathers of modern combinatorics, and their work – on various objects, including (what became later known as) Steiner triple systems – led to several classification results. Almost a century earlier, in 1782, Euler [180] published some results on...

Kreher D.L., Stinson D.R. Combinatorial Algorithms. Generation, Enumeration and Search

формат djvu
размер 3.59 МБ
добавлен 04 октября 2011 г.

Издательство CRC Press, 1999, -340 pp. Our objective in writing this book was to produce a general, introductory textbook on the subject of combinatorial algorithms. Several textbooks on combinatorial algorithms were written in the 1970s, and are now out-of-date. More recent books on algorithms have either been general textbooks, or books on specialized topics, such as graph algorithms to name one example. We felt that a new textbook on combinat...

Lins S. Gems, Computers and Attractors for 3-Manifolds

формат djvu
размер 4.72 МБ
добавлен 16 мая 2011 г.

World Scientific Publishing Company, 1995. - 450 Pages. This text provides a guide to dealing with 3-manifolds by computers. Its emphasis is on presenting algorithms which are used for solving (in practice) the homeomorphism problem for the smallest of these objects. The key concept is the 3-gem, a special kind of edge-colored graph, which encodes the manifold via a ball complex. Passages between 3-gems and more standard presentations like Heega...

Lovasz L. An Algorithmic Theory of Numbers, Graphs, and Convexity

формат djvu
размер 824.05 КБ
добавлен 28 октября 2011 г.

Society for Industrial and Applied Mathematics, 1986, -96 pp. There is little doubt that the present explosion of interest in the algorithmic aspects of mathematics is due to the development of computers — even though special algorithms and their study can be traced back all the way through the history of mathematics. Mathematics started out in Egypt and Babylon as a clearly algorithmic science. In ancient Greece the foundations of its "descript...

Reed D.F., Sales C.L. Recent Advances in Algorithms and Combinatorics

формат pdf
размер 1.54 МБ
добавлен 04 октября 2011 г.

Издательство Springer, 2002, -365 pp. Combinatorics is one of the fastest growing fields of mathematics. In large measure this is because many practical problems can be modeled and then efficiently solved using combinatorial theory. This real world motivation for studying algorithmic combinatorics has led not only to the development of many software packages but also to some beautiful mathematics which has no direct application to applied proble...