FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

  • Safe delivery by Christmas SANTA SAFE
    Combinatorial Algorithms

Combinatorial Algorithms

Donald L. Kreher, Douglas R. Stinson
    Product form
      FORMAT: Hardback

      R 7,588.07 Price and availability exclusive to website

      YOU COULD EARN 7,588.07 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 10 - 15 Business Days
      BUY NOW PAY LATER
      From R 1,264.67 per month!
      3x monthly payments of R 2,529.35 with
      4x fortnightly payments of R 1,897.01 with
      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.
      Format: CONTRIBUTORS: Donald L. Kreher, Douglas R. Stinson EAN: 9780849339882 COUNTRY: United States PAGES: WEIGHT: 660 g HEIGHT: 234 cm
      PUBLISHED BY: Taylor & Francis Inc DATE PUBLISHED: 1998-12-18 CITY: GENRE: COMPUTERS / Programming / Algorithms, MATHEMATICS / General, MATHEMATICS / Number Theory, MATHEMATICS / Combinatorics WIDTH: 156 cm SPINE:

      Book Themes:

      Discrete mathematics, Number theory, Combinatorics and graph theory

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      Kreher, Donald L.; Stinson, Douglas R.
      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.
      Format: CONTRIBUTORS: Donald L. Kreher, Douglas R. Stinson EAN: 9780849339882 COUNTRY: United States PAGES: WEIGHT: 660 g HEIGHT: 234 cm
      PUBLISHED BY: Taylor & Francis Inc DATE PUBLISHED: 1998-12-18 CITY: GENRE: COMPUTERS / Programming / Algorithms, MATHEMATICS / General, MATHEMATICS / Number Theory, MATHEMATICS / Combinatorics WIDTH: 156 cm SPINE:

      Book Themes:

      Discrete mathematics, Number theory, Combinatorics and graph theory

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      Kreher, Donald L.; Stinson, Douglas R.

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account