Combinatorial Algorithms : Generation, Enumeration, and Search

Donald L. (Michigan Technological University, Houghton, USA) Kreher, Douglas R. (University of Waterloo, Ontario, Canada) Stinson

ISBN 10: 084933988X / ISBN 13: 9780849339882

Published by Taylor & Francis Inc, 1998

About this Item

Zustand: Sehr gut | Seiten: 344 | Sprache: Englisch | Produktart: Bücher | 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.

Seller Inventory # 1180887/202

Bibliographic Details

• Title: Combinatorial Algorithms : Generation, Enumeration, and Search
• Publisher: Taylor & Francis Inc
• Publication Date: 1998
• Language: English
• ISBN 10: 084933988X
• ISBN 13: 9780849339882
• Binding: Hardcover
• Condition: Sehr gut
• Seller catalogs:
  • Bücher

About this title

Synopsis

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.

About the Author

Kreher, Donald L.; Stinson, Douglas R.