Combinatorial Algorithms,

This monograph is devoted to the solution of problems presented by the theory of graphs. Topics discussed include graph searching, data structures, models of computation, problems solvable in polynomial time, NP-heuristic methods and the probabilistic analysis of algorithms.



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.