Algorithmic graph theory and perfect graphs
Author(s)
Bibliographic Information
Algorithmic graph theory and perfect graphs
（Annals of discrete mathematics, 57）
Elsevier, c2004
2nd ed
Available at / 31 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
GOL||30||1(2)04000382
-
Hokkaido University, Library, Graduate School of Science, Faculty of Science and School of Science図書
DC22:511.54/G5852080000364
-
No Libraries matched.
- Remove all filters.
Note
Previous ed.: New York: Academic, 1980
Epilogue 2004: p. 277-305
Description and Table of Contents
Description
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.
by "Nielsen BookData"