Combinatorial algorithms
Author(s)
Bibliographic Information
Combinatorial algorithms
Adam Hilger, c1990
- Other Title
-
Kombinatorické algoritmy
Available at / 34 libraries
-
No Libraries matched.
- Remove all filters.
Note
Translation of: Kombinatorické algoritmy
Bibliography : p. [253]-266
Includes index
Description and Table of Contents
Description
Combinatorial Algorithms is devoted to the solution of problems presented by the theory of graphs. This area of problems has been growing dramatically. Until now, the majority of results could only be found in specialized journals, technical reports and conference proceedings. Here for the first time, the subject is dealt with in a systematic manner in one book. Although directed primarily to students of computer science, it will also be useful to programmers and other workers in the area of computers.
Table of Contents
Basic concepts and results. Models of computation. Data structures. Graph searching. Sorting. Problems solvable in polynomial time. NP-complete problems. Classes of difficult problems. Heuristic methods. Probabilistic analysis of algorithms. Bibliography. Index.
by "Nielsen BookData"