Combinatorial Algorithms: Generation, Enumeration, and Search: 7 - Rilegato

Kreher, Donald L.; Stinson, Douglas R.

Rilegato

ISBN 10: 084933988X ISBN 13: 9780849339882

Casa editrice: CRC Press, 1998

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.

Su questo libro

Informazioni sull'autore

Kreher, Donald L.; Stinson, Douglas R.

Dalla quarta di copertina

Combinatorial Algorithms: Generation, Enumeration, and Search thoroughly outlines and analyzes combinatorial algorithms for generation, enumeration, and search applications.

Dettagli dell'edizione

• Editore: CRC Press
• Data di pubblicazione: 1998
• Lingua: Inglese
• ISBN 10: 084933988X
• ISBN 13: 9780849339882
• Rilegatura: Copertina rigida
• Numero edizione: 1
• Numero di pagine: 342
• Contatto del produttore: Taylor and Francis, GPSR Taylor and Francis; gpsr@taylorandfrancis.com; ; Taylor & Francis Verlag GmbH, Kaufingerstraße 24; München; 80331; Germania