ISBN: 9780849339882 - combinatorial algorithms: generation, enumeration, and search (discrete mathematics and its applications, band 7) (23 Ergebnisse)

Hardcover. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

Zustand: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Zustand: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,700grams, ISBN:9780849339882. …

Zustand: Good. First Edition. CRC Press, 1999. First edition, first printing with full number line; cover very lightly rubbed/bumped, corners ever-so-slightly rubbed, spine ends ever-so- slightly bumped; binding tight; cover, edges, and interior intact and clean except as noted. First Edition. hardcover. Good. …

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 344 | Sprache: Englisch | Produktart: Bücher | 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.…

Hardcover. Zustand: New. Brand new book, sourced directly from publisher. Dispatch time is 7-8 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Zustand: New.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: As New. Unread book in perfect condition.

Zustand: New. pp. 344.

Zustand: New.

Zustand: New. Satisfaction Guaranteed or your money back.

Zustand: New. pp. 344.

Hardback. Zustand: New. New copy - Usually dispatched within 4 working days.

Hardcover. Zustand: Brand New. 1st edition. 329 pages. 9.75x6.75x1.25 inches. In Stock.

Hardcover. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Gebunden. Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 a.…

Zustand: New. pp. 344 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam This item is printed on demand.

HRD. Zustand: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

HRD. Zustand: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

Hardback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Buch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Combinatorial Algorithms: Generation, Enumeration, and Search thoroughly outlines and analyzes combinatorial algorithms for generation, enumeration, and search applications.