Добро пожаловать в клуб

Показать / Спрятать  Домой  Новости Статьи Файлы Форум Web ссылки F.A.Q. Логобург    Показать / Спрятать

       
Поиск   
Главное меню
ДомойНовостиСтатьиПостановка звуковФайлыКнижный мирФорумСловарьРассылкаКаталог ссылокРейтинг пользователейЧаВо(FAQ)КонкурсWeb магазинКарта сайта

Поздравляем!
Поздравляем нового Логобуржца Olgsko со вступлением в клуб!

Реклама

КНИЖНЫЙ МИР

Algorithmic Graph Theory and Perfect Graphs (ANNALS OF DISCRETE MATHEMATICS)   Martin Charles Golumbic

Algorithmic Graph Theory and Perfect Graphs (ANNALS OF DISCRETE MATHEMATICS)

Hardbound. Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals version 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. A new Epilogue chapter in this second edition surveys many of the recent results in the area. It also gives pointers for further study. The book has served to unify the topic and to act as a sp
 
- Генерация страницы: 0.04 секунд -