Hoppa till sidans huvudinnehåll

Del i serien Discrete Mathematics and Its Applications

Combinatorial Algorithms

Generation, Enumeration, and Search

Inbunden, Engelska, 1998

AvDonald L. Kreher,Douglas R. Stinson

2 729 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (1)

Häftad

1 369 kr

Skickas inom 10-15 vardagar

This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structures, such as:Combinations Permutations Graphs Designs Many classical areas are covered as well as new research topics not included in most existing texts, such as: Group algorithms Graph isomorphism Hill-climbing Heuristic search algorithms This work serves as an exceptional textbook for a modern course in combinatorial algorithms, providing a unified and focused collection of recent topics of interest in the area. The authors, synthesizing material that can only be found scattered through many different sources, introduce the most important combinatorial algorithmic techniques - thus creating an accessible, comprehensive text that students of mathematics, electrical engineering, and computer science can understand without needing a prior course on combinatorics.

Produktinformation

Tillhör följande kategorier

Hoppa över listan

Mer från samma författare

Hoppa över listan

Mer från samma serie

Hoppa över listan

Du kanske också är intresserad av