menu
{ "item_title" : "Algorithmic Graph Theory", "item_author" : [" Alan Gibbons", "Alan Gibbons "], "item_description" : "This is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with an interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colourability, flows in networks, matchings and traversals) and covers many of the major classical theorems, the emphasis is on algorithms and thier complexity: which graph problems have known efficient solutions and which are intractable. For the intractable problems a number of efficient approximation algorithms are included with known performance bounds. Informal use is made of a PASCAL-like programming language to describe the algorithms. A number of exercises and outlines of solutions are included to extend and motivate the material of the text.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/0/52/128/881/0521288819_b.jpg", "price_data" : { "retail_price" : "69.00", "online_price" : "69.00", "our_price" : "69.00", "club_price" : "69.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Algorithmic Graph Theory|Alan Gibbons

Algorithmic Graph Theory

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

This is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with an interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colourability, flows in networks, matchings and traversals) and covers many of the major classical theorems, the emphasis is on algorithms and thier complexity: which graph problems have known efficient solutions and which are intractable. For the intractable problems a number of efficient approximation algorithms are included with known performance bounds. Informal use is made of a PASCAL-like programming language to describe the algorithms. A number of exercises and outlines of solutions are included to extend and motivate the material of the text.

This item is Non-Returnable

Details

  • ISBN-13: 9780521288811
  • ISBN-10: 0521288819
  • Publisher: Cambridge University Press
  • Publish Date: June 1985
  • Dimensions: 9.08 x 6.1 x 0.69 inches
  • Shipping Weight: 0.93 pounds
  • Page Count: 272

Related Categories

You May Also Like...

    1

BAM Customer Reviews