Combinatorial Algorithms (Discrete Mathematics and Its Applications)

(2)
Combinatorial Algorithms (Discrete Mathematics and Its Applications) image
ISBN-10:

084933988X

ISBN-13:

9780849339882

Edition: 1
Released: Dec 18, 1998
Publisher: CRC-Press
Format: Hardcover, 342 pages
Related ISBN: 9780367400156

Description:

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.
  • Best prices to buy, sell, or rent ISBN 9780849339882




    Frequently Asked Questions about Combinatorial Algorithms (Discrete Mathematics and Its Applications)

    You can buy the Combinatorial Algorithms (Discrete Mathematics and Its Applications) book at one of 20+ online bookstores with BookScouter, the website that helps find the best deal across the web. Currently, the best offer comes from and is $ for the .

    The price for the book starts from $38.98 on Amazon and is available from 24 sellers at the moment.

    If you’re interested in selling back the Combinatorial Algorithms (Discrete Mathematics and Its Applications) book, you can always look up BookScouter for the best deal. BookScouter checks 30+ buyback vendors with a single search and gives you actual information on buyback pricing instantly.

    As for the Combinatorial Algorithms (Discrete Mathematics and Its Applications) book, the best buyback offer comes from and is $ for the book in good condition.

    The Combinatorial Algorithms (Discrete Mathematics and Its Applications) book is in very low demand now as the rank for the book is 2,226,931 at the moment. A rank of 1,000,000 means the last copy sold approximately a month ago.

    The highest price to sell back the Combinatorial Algorithms (Discrete Mathematics and Its Applications) book within the last three months was on January 01 and it was $5.29.