Crc Press

Combinatorial Algorithms (Discrete Mathematics and Its Applications)

Free shipping with 3 or more products in your cart
Payflex: Pay in 4 interest-free payments of R422.75. Read the FAQ
R 1,691
In stock
Low stock in USA warehouse Order soon to secure your order
Used, Good Condition
Duties, insurance and VAT included
Delivered in 10–20 working days —
Free shipping with 3 or more products in your cart
Secure checkout
Your payment is fully protected
Duties & VAT included
No surprise charges at the door
Tracked delivery
Track your order end to end
Returns support
30-day return window

Description

Condition - Very Good

The item shows wear from consistent use but remains in good condition. It may arrive with damaged packaging or be repackaged.

  • Used Book in Good Condition
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.
  • Shipping & Delivery

    Your order is shipped from the USA and delivered to your door in South Africa in 10–20 working days. All items are fully tracked.

    Returns & Exchanges

    We offer a 30-day return window. If something isn't right, contact our support team and we'll make it right.