Algorithmic Graph Theory

Algorithmic Graph Theory

  • Paperback
By (author) 

List price: US$37.41

Currently unavailable

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks

Description

An introduction to graph algorithms and pure graph theory with applications to computer systems. Emphasizing understanding, design, specification and performance, this book provides wide-ranging coverage of algorithms and algorithmic techniques. The author considers recent advances in random and parallel algorithms and includes numerous examples of graph-theoretic modelling. He also presents algorithms using current standards for software specification. He then examines new random and parallel graph processing algorithms, including those on different parallel architectures as well as many shared memory algorithms. There is then coverage of design techniques and design methods, such as divide and conquer and search tree techniques throughout. Finally, the book explores the elements of pure graph theory with exercises covering both graph-theoretical and algorithmic topics.show more

Product details

  • Paperback | 480 pages
  • 179 x 232mm | 534g
  • Pearson Education Limited
  • Prentice-Hall
  • Harlow, United Kingdom
  • International edition
  • 0130190926
  • 9780130190925

Table of contents

Introduction to graph theory; algorithmic techniques; shortest paths; trees and acyclic diagraphs; depth first search; connectivity and routing; graph colouring; covers, domination, independent sets, matchings and factors, parallel algorithms; computational complexity.show more