Trustpilot
Buchhandlungen 
Terminkalender 
Anfang 
Buch Details
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.
Lesen Sie mehr - Schriftsteller Donald L. Kreher, Douglas R. Stinson
- ISBN13 9780849339882
- ISBN10 084933988X
- Buchseiten 344
- Jahr der Ausgabe 1998
- Fecha de publicación 18/12/1998
- Sprache Deutsch, Französisch
Rezensionen und Bewertungen
Sei die erste Person, die es bewertet!
Hast du gelesen Combinatorial Algorithms: Generation, Enumeration, and Search?
Combinatorial Algorithms: Generation, Enumeration, and Search (Deutsch, Französisch)
- Von
- Donald L. Kreher, Douglas R. Stinson
- |
- Chapman and Hall/CRC (1998)
- 9780849339882
172,90€
182,00€
-5%
Sendung Kostenlos
Nicht verfügbar
172,90€
182,00€
-5%
Sendung Kostenlos
Nicht verfügbar
Kostenlose Rücksendung
Vielen Dank für Ihren Einkauf in echten Buchhandlungen!
Neuheit 
Whatsapp
Facebook
Linkedin
X
