Topics in algorithmic graph theory
著者
書誌事項
Topics in algorithmic graph theory
(Encyclopedia of mathematics and its applications / edited by G.-C. Rota, 178)
Cambridge University Press, 2021
- : hardback
並立書誌 全1件
大学図書館所蔵 全10件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Differs from <BC04294783> in statement of responsibility
Includes bibliographical references and index
内容説明・目次
内容説明
Algorithmic graph theory has been expanding at an extremely rapid rate since the middle of the twentieth century, in parallel with the growth of computer science and the accompanying utilization of computers, where efficient algorithms have been a prime goal. This book presents material on developments on graph algorithms and related concepts that will be of value to both mathematicians and computer scientists, at a level suitable for graduate students, researchers and instructors. The fifteen expository chapters, written by acknowledged international experts on their subjects, focus on the application of algorithms to solve particular problems. All chapters were carefully edited to enhance readability and standardize the chapter structure as well as the terminology and notation. The editors provide basic background material in graph theory, and a chapter written by the book's Academic Consultant, Martin Charles Golumbic (University of Haifa, Israel), provides background material on algorithms as connected with graph theory.
目次
- Foreword Martin Charles Golumbic
- Preface Lowell W. Beineke and Robin J. Wilson
- Preliminaries Lowell W. Beineke, Martin Charles Golumbic and Robin J. Wilson
- 1. Graph Algorithms Martin Charles Golumbic
- 2. Graph Colouring Variations Alain Hertz and Bernard Ries
- 3. Total Colouring Celina M. H. de Figueiredo
- 4. Testing of Graph Properties Ilan Newman
- 5. Cliques, Colouring and Satisfiability: From Structure to Algorithms Vadim Lozin
- 6. Chordal Graphs Martin Charles Golumbic
- 7. Dually and Strongly Chordal Graphs Andreas Brandstadt and Martin Charles Golumbic
- 8. Leaf Powers Christian Rosenke, Van Bang Le and Andreas Brandstadt
- 9. Split Graphs Karen L. Collins and Ann N. Trenk
- 10. Strong Cliques and Stable Sets Martin Milanic
- 11. Restricted Matchings Maximilian Furst and Dieter Rautenbach
- 12. Covering Geometric Domains Gila Morgenstern
- 13. Graph Homomorphisms Pavol Hell and Jaroslav Nesetril
- 14. Sparsity and Model Theory Patrice Ossona de Mendez
- 15. Extremal Vertex-sets Serge Gaspers
- Notes on Contributors
- Index.
「Nielsen BookData」 より