Title
Combinatorial Algorithms (Discrete Mathematics and Its Applications),New
Sold by Ergodebooks, an authorized reseller.
Returns accepted within 30 days | support@ergodebooks.com
Shipping Information
- Free Standard Shipping — United States only
- Processing Time: 1–3 business days
- Estimated Delivery: 3–5 business days after dispatch
- Double-boxed, fully insured & discreetly packaged
- Tracking number sent via email once dispatched
- Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund
Returns accepted within 30 days of delivery.
Damaged or Defective Item
Free return shipping + replacement or full refund
Wrong Item Received
Free return shipping + replacement or full refund
Change of Mind
Return shipping at customer's expense · 25% restocking fee applies
Payment Option
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: CombinationsPermutationsGraphsDesignsMany classical areas are covered as well as new research topics not included in most existing texts, such as:Group algorithmsGraph isomorphismHillclimbingHeuristic search algorithmsThis 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.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.
- Q: What topics are covered in 'Combinatorial Algorithms'? A: 'Combinatorial Algorithms' covers various topics including backtracking methods, heuristic search methods, combinations, permutations, graphs, and designs. It also addresses classical areas and new research topics such as group algorithms, graph isomorphism, hill-climbing, and heuristic search algorithms.
- Q: Who is the author of this textbook? A: The textbook is authored by Donald L. Kreher.
- Q: What is the condition of the book? A: The book is in 'New' condition, ensuring that it is free from any wear or damage.
- Q: How many pages does the textbook have? A: 'Combinatorial Algorithms' contains a total of 342 pages, providing a comprehensive overview of the subject.
- Q: What is the binding type of the book? A: The book is bound in hardcover, which offers durability and protection for the pages.
- Q: When was 'Combinatorial Algorithms' published? A: The textbook was published on December 18, 1998.
- Q: Is this book suitable for beginners in combinatorial algorithms? A: Yes, this textbook is designed to be accessible and comprehensible, making it suitable for students of mathematics, electrical engineering, and computer science, even without prior knowledge of combinatorics.
- Q: Does the book include any recent research topics? A: Yes, it includes discussions on recent research topics that are not commonly found in most existing texts, enhancing its value for students and professionals.
- Q: What is the edition of the book? A: This is the first edition of 'Combinatorial Algorithms'.
- Q: Is there a specific audience for this textbook? A: This textbook is aimed at students and professionals in mathematics, electrical engineering, and computer science who are interested in combinatorial algorithms.