×


 x 

Shopping cart
Gabriel Valiente - Algorithms on Trees and Graphs - 9783540435501 - V9783540435501
Stock image for illustration purposes only - book cover, edition or condition may vary.

Algorithms on Trees and Graphs

€ 98.99
FREE Delivery in Ireland
Description for Algorithms on Trees and Graphs Hardback. Introduces graph algorithms on an intuitive basis followed by an exposition in a literate programming style, with correctness proofs as well as worst-case analyses. This book provides C++ implementations of algorithms using the LEDA library of data structures and algorithms. Num Pages: 489 pages, biography. BIC Classification: UMB; UYAM. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 28. Weight in Grams: 860.

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, ... Read more

Show Less

Product Details

Format
Hardback
Publication date
2002
Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Germany
Number of pages
489
Condition
New
Number of Pages
489
Place of Publication
Berlin, Germany
ISBN
9783540435501
SKU
V9783540435501
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15

Reviews for Algorithms on Trees and Graphs
From the reviews: "The main theme of this (research) monograph on graph algorithms is the isomorphism problem (for trees and graphs). Algorithms are both described on an intuitive basis and presented (and discussed) in detail using Knuth’s literate programming style (C++, using the LEDA library). Besides offering an introduction to an interesting and important subject ... Read more

Goodreads reviews for Algorithms on Trees and Graphs


Subscribe to our newsletter

News on special offers, signed editions & more!