Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!

N� de ref. del art�culo S_410013045

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo: Combinatorial Algorithms: Enlarged Second Edition (Dover Books on Computer Science)
Editor: Dover Publications
Fecha de publicaci�n: 2002
Idioma: Ingl�s
ISBN 10: 0486419622
ISBN 13: 9780486419626
Encuadernaci�n: paperback
Edici�n: 2� Edici�n
Estado: Good

Acerca de

Sinopsis

Newly enlarged, updated second edition of a valuable text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discusses binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. 153 black-and-white illus. 23 tables.
Newly enlarged, updated second edition of a valuable, widely used text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discussed are binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. New to this edition: Chapter 9 shows how to mix known algorithms and create new ones, while Chapter 10 presents the "Chop-Sticks" algorithm, used to obtain all minimum cuts in an undirected network without applying traditional maximum flow techniques. This algorithm has led to the new mathematical specialty of network algebra. The text assumes no background in linear programming or advanced data structure, and most of the material is suitable for undergraduates. 153 black-and-white illus. 23 tables. Exercises, with answers at the ends of chapters.

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