Skip to content

Algorithms on Trees and Graphs
Stock Photo: Cover May Be Different

Algorithms on Trees and Graphs Hardback - - 2002nd Edition

by Gabriel Valiente

  • New
  • Hardcover

Description

Springer , pp. 508 . Hardback. New.
New
NZ$167.17
NZ$6.64 Shipping to USA
Standard delivery: 9 to 14 days
More Shipping Options
Ships from Cold Books (New York, United States)

Details

  • Title Algorithms on Trees and Graphs
  • Author Gabriel Valiente
  • Binding Hardback
  • Edition number 2002nd
  • Edition 2002
  • Condition New
  • Pages 489
  • Volumes 1
  • Language ENG
  • Publisher Springer , Berlin
  • Date pp. 508
  • Illustrated Yes
  • Features Bibliography, Illustrated, Index
  • Bookseller's Inventory # 6351384
  • ISBN 9783540435501 / 3540435506
  • Weight 1.89 lbs (0.86 kg)
  • Dimensions 8.98 x 6.96 x 1.29 in (22.81 x 17.68 x 3.28 cm)
  • Library of Congress Catalog Number 2002029195
  • Dewey Decimal Code 511.5

About Cold Books New York, United States

Biblio member since 2012
Seller rating: This seller has earned a 5 of 5 Stars rating from Biblio customers.

Terms of Sale: 30 day return guarantee, with full refund including shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Cold Books

From the publisher

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. Full C++ implementations of all algorithms presented are given using the LEDA library of efficient data structures and algorithms.

First line

The notion of graph which is most useful in computer science is that of directed graph, or just graph.

From the rear cover

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