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:
"synopsis" may belong to another edition of this title.
Kreher, Donald L.; Stinson, Douglas R.
"About this title" may belong to another edition of this title.
£ 1.98 shipping within U.S.A.
Destination, rates & speeds£ 15 shipping from United Kingdom to U.S.A.
Destination, rates & speedsSeller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 38666880
Quantity: 1 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 38666880-n
Quantity: 6 available
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Paperback / softback. Condition: New. New copy - Usually dispatched within 4 working days. 189. Seller Inventory # B9780367400156
Quantity: 1 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 38666880-n
Quantity: 1 available
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 344 pages. 9.21x6.14x0.87 inches. In Stock. This item is printed on demand. Seller Inventory # __0367400154
Quantity: 1 available
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. pp. 344. Seller Inventory # 381791909
Quantity: 3 available
Seller: Grand Eagle Retail, Fairfield, OH, U.S.A.
Paperback. Condition: new. Paperback. 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. Combinatorial Algorithms: Generation, Enumeration, and Search thoroughly outlines and analyzes combinatorial algorithms for generation, enumeration, and search applications. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780367400156
Quantity: 1 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9780367400156_new
Quantity: Over 20 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: As New. Unread book in perfect condition. Seller Inventory # 38666880
Quantity: 6 available
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 344. Seller Inventory # 26381030778
Quantity: 3 available