← Back to discovery

Combinatorial algorithms

Donald L. Kreher

1999329 pagesabout 5–8 hours
1999
first published
  • 1999CRC Press · 329 pages · ENGISBN 9780849339882
  • 2019Taylor & Francis Group · 344 pages · ENGISBN 9780367400156
  • 2020Taylor & Francis Group · 344 pages · ENGISBN 9781000141375
  • 2020Taylor & Francis Group · 344 pages · ENGISBN 9781000102871
  • 2020Taylor & Francis Group · 344 pages · ENGISBN 9781000120042
  • 2020Taylor & Francis Group · 344 pages · ENGISBN 9781003068006

"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, and 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, and heuristic search algorithms."--BOOK JACKET.

How do you feel?