Algorithmic Graph Theory and Perfect Graphs, Volume 57, 2/e
暫譯: 算法圖論與完美圖,第57卷,第二版
Martin Charles Golumbic
- 出版商: North Holland
- 出版日期: 2004-02-04
- 售價: $3,620
- 貴賓價: 9.5 折 $3,439
- 語言: 英文
- 頁數: 340
- 裝訂: Hardcover
- ISBN: 0444515305
- ISBN-13: 9780444515308
-
相關分類:
Algorithms-data-structures
海外代購書籍(需單獨結帳)
買這商品的人也買了...
-
$700$665 -
$550$495 -
$720$569 -
$980$774 -
$1,200$948 -
$640$544 -
$880$695 -
$600$480 -
$420$357 -
$700$553 -
$720$569 -
$490$417 -
$580$458 -
$680$578 -
$580$452 -
$780$616 -
$590$460 -
$480$379 -
$780$663 -
$880$695 -
$680$578 -
$550$435 -
$620$490 -
$690$587 -
$320$272
相關主題
商品描述
Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping stone from which the reader may embark on one of many fascinating research trails.
The past twenty years have been an amazingly fruitful period of research in algorithmic graph theory and structured families of graphs. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. These have lead to new families of perfect graphs and many algorithmic results. These are surveyed in the new Epilogue chapter in this second edition.
· New edition of the "Classic" book on the topic
· Wonderful introduction to a rich research area
· Leading author in the field of algorithmic graph theory
· Beautifully written for the new mathematician or computer scientist
· Comprehensive treatment
The past twenty years have been an amazingly fruitful period of research in algorithmic graph theory and structured families of graphs. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. These have lead to new families of perfect graphs and many algorithmic results. These are surveyed in the new Epilogue chapter in this second edition.
· New edition of the "Classic" book on the topic
· Wonderful introduction to a rich research area
· Leading author in the field of algorithmic graph theory
· Beautifully written for the new mathematician or computer scientist
· Comprehensive treatment
商品描述(中文翻譯)
《算法圖論與完美圖》,首次出版於1980年,已成為該領域的經典入門書籍。這本新的《年刊》版本繼續傳達交集圖模型是解決現實世界問題所需的重要工具的訊息。它仍然是讀者可以踏上眾多迷人研究路徑的跳板。
過去二十年是算法圖論和結構化圖族研究的驚人豐收期。特別重要的是新交集圖模型的理論和應用,例如置換圖和區間圖的推廣。這些導致了新的完美圖族和許多算法結果。在這第二版的新《後記》章節中對這些進行了概述。
· 該主題的“經典”書籍的新版本
· 對豐富研究領域的精彩介紹
· 算法圖論領域的領先作者
· 為新數學家或計算機科學家精美撰寫
· 全面的處理