Algorithms on Trees and Graphs - Tapa dura

Valiente, Gabriel

 
9783540435501: Algorithms on Trees and Graphs
Tapa dura
ISBN 10: 3540435506 ISBN 13: 9783540435501
Editorial: Springer, 2002

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

De la contraportada

Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, like 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. Numerous illustrations, examples, and exercises, and a comprehensive bibliography support students and professionals in using the book as a text and source of reference

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

Editorial
Springer
Año de publicación
2002
Idioma
Inglés
ISBN 10 
3540435506
ISBN 13 
9783540435501
Encuadernación
Tapa dura
Número de páginas
508
Contacto del fabricante
no disponible
Persona responsable
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Alemania

Otras ediciones populares con el mismo título

9783642078095: Algorithms on Trees and Graphs

Edición Destacada

ISBN 10:  3642078095 ISBN 13:  9783642078095
Editorial: Springer, 2013
Tapa blanda