Combinatorial Algorithms: Generation, Enumeration, and Search (Discrete Mathematics and Its Applications)-P2P
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.

Combinatorial Algorithms: Generation, Enumeration, and Search (Discrete Mathematics and Its Applications)-P2P
English | 1998 | ISBN-13: 978-0849339882 | 344 Pages | PDF | 10 MB
Download: ( NITROFLARE ) | ( RAPIDGATOR )

Comments (1)
https://userupload.net/18348rbv53o4
http://hexupload.net/5y94cl3i33f4
https://dropapk.to/ih3jge9blwk4
https://mega4up.com/1yfam1gq6216
https://rockfile.co/lu08jj8p1nib.html
https://usersdrive.com/efh2jlis6622.html
https://www.file-upload.com/sw1tfv2jzrqy
https://dailyuploads.net/hasx1r12f2no