Hoppa till sidans huvudinnehåll

Algorithmic Graph Theory

Häftad, Engelska, 1985

AvAlan Gibbons

709 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

  • Utgivningsdatum1985-06-27
  • Mått155 x 231 x 18 mm
  • Vikt420 g
  • FormatHäftad
  • SpråkEngelska
  • Antal sidor272
  • FörlagCambridge University Press
  • ISBN9780521288811

Tillhör följande kategorier

Hoppa över listan

Mer från samma författare

Del 4

Lectures in Parallel Computation

Alan Gibbons, Paul Spirakis, Alan (University of Warwick) Gibbons, Greece) Spirakis, Paul (University of Patras, P. Spirakis, W. F. McColl

Häftad

1 199 kr

Efficient Parallel Algorithms

Alan Gibbons, Wojciech Rytter, Alan (University of Warwick) Gibbons, Poland) Rytter, Wojciech (Uniwersytet Warszawski

Häftad

769 kr

Hoppa över listan

Du kanske också är intresserad av