Könyv Algorithms on Trees and Graphs Gabriel Valiente

Algorithms on Trees and Graphs

Szerző: Gabriel Valiente
Nyelv: Angol
Kötés: Puha kötésű
Elérhetőség: 50 % esély
Keressük az egész világon
26 299 Ft
Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical...

Információk a könyvről

Nyelv
Angol
Kötés
Könyv - Puha kötésű
Kiadva
2010
oldal
490
EAN
9783642078095
ISBN
3642078095
Enbook ID
01652902
Súly
771
Méretek
155 x 235 x 25

Teljes leírás

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.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

Érdekelheti

3 842 Ft
2 832 Ft

Charlie the Dot

Charisma Ann James
3 842 Ft
77 092 Ft
5 107 Ft

School for Sleuths

Dan Andriacco
5 192 Ft
9 721 Ft
25 814 Ft
5 192 Ft

Fear of Jesus

Carla R Mancari
3 186 Ft
26 141 Ft

Pick-Up Game

Marc Aronson
2 688 Ft

Fluids

May Leitz
6 207 Ft

Joker

Brian Azzarello
6 548 Ft
47 943 Ft
7 997 Ft

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

TECNICA

Francesco Fareri
5 879 Ft

yathartha chetana

pranshi shukla 'chetana'
5 080 Ft

Shaolin Spirit

Shi Heng Yi
9 451 Ft

Da kleene Prinz

Lorenz Justin Loserth
7 046 Ft

Orkanski visovi

Emily Brontë
14 330 Ft
3 770 Ft

TODO BELLÓN

JULIAN IBAÑEZ
9 393 Ft