Description: Combinatorial Algorithms : Generation, Enumeration, and Search, Hardcover by Kreher, Donald L.; Stinson, Douglas R., ISBN 084933988X, ISBN-13 9780849339882, Brand New, Free shipping in the US An introduction to the most important combinatorial algorithmic techniques. Provides coverage of classical areas in the discipline as well as new research topics such as group algorithms, graph isomorphism, hill-climbing, and heuristic search algorithms. Also covers backtracking and heuristic search methods as applied to various combinatorial structures such as combinations, permutations, graphs, and designs. Intended for students of mathematics, electrical engineering, and computer science who have not necessarily had a prior course on combinatorics. Annotation c. by Book News, Inc., Portland, Or.
Price: 195.29 USD
Location: Jessup, Maryland
End Time: 2024-10-20T00:22:23.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 14 Days
Refund will be given as: Money Back
Return policy details:
Book Title: Combinatorial Algorithms : Generation, Enumeration, and Search
Number of Pages: 344 Pages
Language: English
Publication Name: Combinatorial Algorithms : Generation, Enumeration, and Search
Publisher: CRC Press LLC
Item Height: 1 in
Subject: Operating Systems / General, Algebra / General, Number Theory, Combinatorics
Publication Year: 1998
Type: Textbook
Item Weight: 22.4 Oz
Author: Donald L. Kreher, Douglas R. Stinson
Item Length: 9.5 in
Subject Area: Mathematics, Computers
Item Width: 6.4 in
Series: Discrete Mathematics and Its Applications Ser.
Format: Hardcover
