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.
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Für höhere Schule und Studium
Für Beruf und Forschung
Students and research workers in mathematics (graph theory), computer science and operations research and programmers.
ISBN-13
978-0-85274-298-3 (9780852742983)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Klassifikation
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.
