4.6
Història 
Agenda 
Llibreries 
Inici 
Detalls del llibre
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.
Llegir més - Autors Donald L. Kreher, Douglas R. Stinson
- ISBN13 9780849339882
- ISBN10 084933988X
- Pàgines 344
- Any Edició 1998
- Fecha de publicación 18/12/1998
- Idioma Alemany, Francès
Ressenyes i valoracions
Sigues la primera persona a valorar-lo!
Has llegit Combinatorial Algorithms: Generation, Enumeration, and Search?
Combinatorial Algorithms: Generation, Enumeration, and Search (Alemany, Francès)
- De
- Donald L. Kreher, Douglas R. Stinson
- |
- Chapman and Hall/CRC (1998)
- 9780849339882
172,90€
182,00€
-5%
Enviament Gratuït
No disponible
172,90€
182,00€
-5%
Enviament Gratuït
No disponible
Devolució gratuïta
Gràcies per comprar a llibreries reals!
Novetat 
Whatsapp
Facebook
Linkedin
X
