Topics in Algorithmic Graph Theory (Encyclopedia of Mathematics and its Applications)

個数:

Topics in Algorithmic Graph Theory (Encyclopedia of Mathematics and its Applications)

  • 提携先の海外書籍取次会社に在庫がございます。通常3週間で発送いたします。
    重要ご説明事項
    1. 納期遅延や、ご入手不能となる場合が若干ございます。
    2. 複数冊ご注文の場合は、ご注文数量が揃ってからまとめて発送いたします。
    3. 美品のご指定は承りかねます。

    ●3Dセキュア導入とクレジットカードによるお支払いについて
  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Hardcover:ハードカバー版/ページ数 364 p.
  • 言語 ENG
  • 商品コード 9781108492607
  • DDC分類 511.5

Full Description

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.

Contents

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 Brandstädt and Martin Charles Golumbic; 8. Leaf Powers Christian Rosenke, Van Bang Le and Andreas Brandstädt; 9. Split Graphs Karen L. Collins and Ann N. Trenk; 10. Strong Cliques and Stable Sets Martin Milanič; 11. Restricted Matchings Maximilian Fürst and Dieter Rautenbach; 12. Covering Geometric Domains Gila Morgenstern; 13. Graph Homomorphisms Pavol Hell and Jaroslav Nešetřil; 14. Sparsity and Model Theory Patrice Ossona de Mendez; 15. Extremal Vertex-sets Serge Gaspers; Notes on Contributors; Index.

最近チェックした商品