Combinatorial Algorithms: Generation, Enumeration, and Search (Discrete Mathematics and Its Applications)

Kreher, Donald L.; Stinson, Douglas R.

ISBN 10: 084933988X / ISBN 13: 9780849339882

Editore: CRC Press, 1999

Riguardo questo articolo

CRC Press, 1999. First edition, first printing with full number line; cover very lightly rubbed/bumped, corners ever-so-slightly rubbed, spine ends ever-so- slightly bumped; binding tight; cover, edges, and interior intact and clean except as noted. First Edition. hardcover. Good.

Codice articolo 618642

Dati bibliografici

• Titolo: Combinatorial Algorithms: Generation, Enumeration, and Search (Discrete Mathematics and Its Applications)
• Editore: CRC Press
• Data di pubblicazione: 1999
• Lingua: Inglese
• ISBN 10: 084933988X
• ISBN 13: 9780849339882
• Rilegatura: Rilegato
• Edizione: First Edition.
• Condizione: Good
• Cataloghi dei venditori:
  • Mathematics
  • New Additions

Descrizione articolo

Riassunto

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.

Informazioni sull?autore

Kreher, Donald L.; Stinson, Douglas R.