search for books and compare prices
Combinatorial Algorithms: Generation, Enumeration, and Search
Price
Store
Arrives
Preparing
Shipping
Jump quickly to results on these stores:
The price is the lowest for any condition, which may be new or used; other conditions may also be available.
Jump down to see edition details for: Hardcover
Bibliographic Detail
Publisher
CRC Pr I Llc
Publication date
December 1, 1998
Pages
329
Binding
Hardcover
Book category
Adult Non-Fiction
ISBN-13
9780849339882
ISBN-10
084933988X
Dimensions
1.25 by 6.75 by 9.75 in.
Weight
1.45 lbs.
Original list price
$132.95
Other format details
sci/tech
Amazon.com says people who bought this book also bought:
Computational Geometry
Computational Geometry
Summaries and Reviews
(view table of contents)
Amazon.com description: Product 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.
Many classical areas are covered as well as new research topics not included in most existing texts, such as:
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.
Editions
Hardcover
The price comparison is for this edition
from CRC Pr I Llc (December 1, 1998)
9780849339882 | details & prices | 329 pages | 6.75 × 9.75 × 1.25 in. | 1.45 lbs | List price $132.95
About: This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search.
About: This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search.
Pricing is shown for items sent to or within the U.S., excluding shipping and tax. Please consult the store to determine exact fees. No warranties are made express or implied about the accuracy, timeliness, merit, or value of the information provided. Information subject to change without notice. isbn.nu is not a bookseller, just an information source.