Combinatorial Algorithms (Discrete Mathematics and Its Applications)

Kreher, Donald L.; Stinson, Douglas R.

ISBN 10: 084933988X / ISBN 13: 9780849339882

Published by CRC Press, 1998

About this Item

This item is in overall good condition. Covers and dust jackets are intact but may have minor wear including slight curls or bends to corners as well as cosmetic blemishes including stickers. Pages are intact but may have minor highlighting writing. Binding is intact; however, spine may have slight wear overall. Digital codes may not be included and have not been tested to be redeemable and or active. Minor shelf wear overall. Please note that all items are donated goods and are in used condition. Orders shipped Monday through Friday! Your purchase helps put people to work and learn life skills to reach their full potential. Orders shipped Monday through Friday. Your purchase helps put people to work and learn life skills to reach their full potential. Thank you!

Seller Inventory # 466SGT003275

Bibliographic Details

• Title: Combinatorial Algorithms (Discrete Mathematics and Its Applications)
• Publisher: CRC Press
• Publication Date: 1998
• Language: English
• ISBN 10: 084933988X
• ISBN 13: 9780849339882
• Binding: Hardcover
• Condition: good

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.