Download Now

Combinatorial Algorithms: Theory and Practice
Edward M. Reingold,
1977 | pages: 444 | ISBN: 013152447X | DJVU | 3,8 mb

The field of combinatorial algorithms concerns the problems of performing computations on discrete, finite mathematical structures. It is a new field, and only in the past few years has it started to emerge as a systematic body of knowledge instead of a collection of unrelated tricks. Its emergence as a new discipline is due to three factors:
- An increase in the practical importance of computation of a combinatorial nature, as compared to other computation. Rapid progress, primarily of a mathematical nature, in the design and analysis of algorithms.
- A shift in emphasis from the consideration of particular combinatorial algorithms to the examination of properties shared by a class of algorithms.

Download link:




Links are Interchangeable - No Password - Single Extraction
Direct Download

Tags: Practice, Theory, Algorithms, Combinatorial

Add Comments:
Enter Code: *