Algorithmic Graph Theory 1st Edition by Alan Gibbons (PDF)

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.

User’s Reviews

Reviews from Amazon users which were colected at the time this book was published on the website:

⭐この本の出版は1985年である。英文は短文で分かりやすい。グラフの埋め込み可能性は邦訳ではわかりにくい本がおおいがこの本の説明は非常に明確でわかりやすい。また計算法はPASCAL-likeの様式で要約されているのでプログラムの自作が容易となっている。邦訳がないようだが価値ある原書である。

⭐

⭐

Keywords

Free Download Algorithmic Graph Theory 1st Edition in PDF format
Algorithmic Graph Theory 1st Edition PDF Free Download
Download Algorithmic Graph Theory 1st Edition 1985 PDF Free
Algorithmic Graph Theory 1st Edition 1985 PDF Free Download
Download Algorithmic Graph Theory 1st Edition PDF
Free Download Ebook Algorithmic Graph Theory 1st Edition