
English
Beginner
Mathematic Combinatorics
Combinatorial algorithms: generation, enumeration, and search
Kreher, Donald L.;Stinson, Douglas Robert
4.5 / 5
0 reviews
2020
Published
342
pages
415
views
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:CombinationsPermutationsGraphsDesignsMany classical areas are covered
About this book
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:CombinationsPermutationsGraphsDesignsMany classical areas are covered as well as new research topics not included in most existing texts, such as:Group algorithmsGraph isomorphismHill-climbingHeuristic search algorithmsThis 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.
Ask this book
Your question is answered in the context of this title and author. Each answer uses 2 points.
Sign in to ask the book assistant.
Reader reviews
0 reviews · 4.5 average out of 5
No reviews yet
If you have read this book, help the next reader with your experience.
Write a review
Sign in to publish a review.
Reader questions and answers
Ask a focused question and learn from the community.
Sign in to ask or answer a question.
No questions yet
Be the first to ask a clear, useful question.
What to read next
Related references that continue this learning path.