Algorithmic graph theory

Alan Gibbons

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.

「Nielsen BookData」より

[目次]

  • Preface
  • 1. Introducing graphs and algorithmic complexity
  • 2. Spanning-trees, branchings and connectivity
  • 3. Planar graphs
  • 4. Networks and flows
  • 5. Matchings
  • 6. Eulerian and Hamiltonian tours
  • 7. Colouring graphs
  • 8. Graph problems and intractability
  • Appendix
  • Author Index
  • Subject Index.

「Nielsen BookData」より

この本の情報

書名 Algorithmic graph theory
著作者等 Gibbons, Alan
Gibbons Alan
出版元 Cambridge University Press
刊行年月 c1985
ページ数 xii, 259 p.
大きさ 24 cm
ISBN 0521288819
0521246598
NCID BA03554330
※クリックでCiNii Booksを表示
言語 英語
出版国 イギリス
この本を: 
このエントリーをはてなブックマークに追加

このページを印刷

外部サイトで検索

この本と繋がる本を検索

ウィキペディアから連想