Free delivery for orders over 69.99 euro.

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 69.99 €

DPD courier 5.99 € Bpost point 7.99 € Bpost 7.49 € DPD point 3.49 € GLS courier 4.49 €

Contact

How to shop

Help

My account

▸ Empty :-(

Free delivery for orders over 69.99 euro.

Algorithms on Trees and Graphs

Name: Algorithms on Trees and Graphs
Brand: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
SKU: 01564262
Price: 86.89 EUR
Availability: InStock
Author: Gabriel Valiente
ISBN: 9783540435501

Gabriel Valiente

Language

English

Book Hardback

Libristo code: 01564262

Publishers Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, September 2002

Centered around the fundamental issue of graph isomorphism, this text goes beyond classical graph pr... Full description

Libristo code: 01564262

210 b

86.89 €

In stock at our supplier Shipping in 10-18 days

30-day return policy

Customers also purchased

De Nietzsche a los pensadores del absurdo Suances

Paperback

31.19 €

Auktionator Staat - Wirtschaftsrechtliche Betrachtung der UMTS-Lizenzversteigerung Michael Valerius

Paperback

17.11 €

MIGHTY MORPHIN POWER RANGERS PINK AA VV

Paperback

32.30 €

An Tarrag Tamara Nic A' Ghr?dair

Paperback

22.27 €

arte di osservare con il telescopio Salvatore Albano

Book

30.88 €

CAHIERS DE L'INED, N 91. L'INTERRUPTION VOLONTAIRE DE GROSSESSE DANS AUTEURS DIVERS

Paperback

11.94 €

Koristemallit Sirkku Liiti

Paperback

30.07 €

Männer in der Nacht Ernst Weiß

Hardback

41.01 €

Compendio de problemas de matemáticas III Juan de Dios Molina Mendoza

Paperback

21.77 €

Die Souveränität Hermann Heller

Paperback

50.02 €

Wer erbt, muss auch gießen. Die Online-Omi teilt auf, 3 Audio-CDs Renate Bergmann

Audio CD

16.90 €

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.