Hüppa põhisisu juurde
Raamatukoi
Tõde ja õigus

Combinatorial Algorithms

Generation, Enumeration, and Search

Donald L. Kreher, Douglas R. Stinson · Taylor & Francis Ltd · 2019

Combinatorial Algorithms

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.

Saadavus
118,50 €

Uus kasutamata raamat

Täna tellides on tarneaeg umbes 10 päeva (27.11.2026)Tellimuse täitmise aeg on umbkaudne ja sõltub nädalapäevast, millal tellimus tehakse. Reeglina ei kulu üle kahe nädala.

Tarne ja kättesaamine

Detailid

Alapealkiri
Generation, Enumeration, and Search
ISBN
9780367400156
Aasta
2019
Keel
inglise
Köide
Pehme kaas
Lehekülgi
344
Kaal
544 g