Combinatorial Algorithms Generation, Enumeration, and Search

Cover of Combinatorial Algorithms Generation, Enumeration, and Search by Donald L. Kreher
Year: 2019
Language: en
Edition: 1
Pages: 344
ISBN-13: 9780367400156
Dimensions:
Height: 9.21258 Inches
Length: 6.14172 Inches
Weight: 1.1794731017 Pounds
Width: 0.78 Inches
Dewey Decimal: 005.1/2
Editorial overview Touché

Combinatorial Algorithms Generation, Enumeration, and Search by Donald L. Kreher is a comprehensive textbook published by Taylor & Francis Group in November 2019. Spanning 344 pages, this edition is written in English and provides an in-depth exploration of combinatorial algorithms, focusing on generation, enumeration, and search techniques. The book covers essential topics such as backtracking and heuristic search methods applied to various combinatorial structures, including combinations, permutations, and graphs.

Readers will find a thorough examination of both classical areas and contemporary research topics, including group algorithms and graph isomorphism. This textbook serves as a valuable resource for students in mathematics, electrical engineering, and computer science, presenting a unified collection of algorithmic techniques. It aims to make complex concepts accessible without requiring prior knowledge of combinatorics, making it suitable for modern courses in the field.


Official synopsis Publisher

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.

FAQ
What is “Combinatorial Algorithms Generation, Enumeration, and Search” about?
This page includes the available description and bibliographic details for “Combinatorial Algorithms Generation, Enumeration, and Search” by Donald L. Kreher. Synopsis preview: 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: Combinati…
Who is the author of “Combinatorial Algorithms Generation, Enumeration, and Search”?
“Combinatorial Algorithms Generation, Enumeration, and Search” is credited to Donald L. Kreher.
When was “Combinatorial Algorithms Generation, Enumeration, and Search” published?
Publisher: Taylor & Francis Group. Year: 2019.
What is the ISBN for “Combinatorial Algorithms Generation, Enumeration, and Search”?
ISBN-13: 9780367400156.
What are the book details (language, pages, edition)?
Language: en. Pages: 344. Edition: 1.

Related Books by Topic