Algorithms on Trees and Graphs (Hardcover, 2002 ed.)

Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, such as approximation, combinatorial optimization, graphics, and operations research, graph algorithms have recently attracted increased attention from computational molecular biology and computational chemistry. Centered around the fundamental issue of graph isomorphism, this text goes beyond classical graph problems of shortest paths, spanning trees, flows in networks, and matchings in bipartite graphs. Advanced algorithmic results and techniques of practical relevance are presented in a coherent and consolidated way. This book introduces graph algorithms on an intuitive basis followed by a detailed exposition in a literate programming style, with correctness proofs as well as worst-case analyses. Furthermore, full C++ implementations of all algorithms presented are given using the LEDA library of efficient data structures and algorithms.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Release date:	September 2002
First published:	2002
Authors:	Gabriel Valiente
Dimensions:	235 x 155 x 28mm (L x W x T)
Format:	Hardcover
Pages:	489
Edition:	2002 ed.
ISBN-13:	978-3-540-43550-1
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Science & Mathematics > Mathematics > Applied mathematics > Mathematics for scientists & engineers Promotions
LSN:	3-540-43550-6
Barcode:	9783540435501

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!