Algorithmic graph theory and perfect graphs [electronic resource]

• 作者： Golumbic, Martin Charles.
• 其他作者：
  • ScienceDirect (Online service)
• 出版： Amsterdam ;Boston : Elsevier
• 叢書名： Annals of discrete mathematics57
• 主題： Perfect graphs. , Teoria dos grafos. , Computabilidade e complexidade. , Programacao matematica. , Programacao inteira e fluxos em rede. , Grafentheorie. , Graphes parfaits. , Electronic books.
• ISBN： 9780444515308 、 0444515305
• FIND@SFXID: CGU
• 資料類型: 電子書
• 內容註: Includes bibliographies and index.
• More
• 摘要註: 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.
• 讀者標籤：

  需登入
• 引用連結：

  Copy Link
• 目前引用數
• Share: