T�tulo: Combinatorial Algorithms: Generation, Enumeration, and Search (Discrete Mathematics and its Applications)
Editor: CRC Press 1998-12-18
Fecha de publicaci�n: 1998
Idioma: Ingl�s
ISBN 10: 084933988X
ISBN 13: 9780849339882
Encuadernaci�n: Hardcover
Estado: New

Acerca de

Sinopsis

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.

Acerca del autor

Kreher, Donald L.; Stinson, Douglas R.

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Descripci�n de la librer�a

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

WRAP Ltd
Unit 4, 119 Loverock Rd, Reading, RG30 1DZ, United Kingdom

Condiciones de venta y env�o

Condiciones de venta

TBA

Condiciones de env�o

Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.