Combinatorial algorithms: generation, enumeration, and search
4.5
Reviews from our users
You Can Ask your questions from this book's AI after Login
Each download or ask from book AI costs 2 points. To earn more free points, please visit the Points Guide Page and complete some valuable actions.Related Refrences:
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.
Free Direct Download
You Can Download this book after Login
Accessing books through legal platforms and public libraries not only supports the rights of authors and publishers but also contributes to the sustainability of reading culture. Before downloading, please take a moment to consider these options.
Find this book on other platforms:
WorldCat helps you find books in libraries worldwide.
See ratings, reviews, and discussions on Goodreads.
Find and buy rare or used books on AbeBooks.
1321
بازدید4.5
امتیاز0
نظر98%
رضایتReviews:
4.5
Based on 0 users review
Questions & Answers
Ask questions about this book or help others by answering
Please login to ask a question
No questions yet. Be the first to ask!