Graph ColoringsMarek Kubale American Mathematical Society, 11 thg 6, 2004 - 208 trang This book is devoted to problems in graph coloring, which can be viewed as one area of discrete optimization. Chapters are dedicated to various models and are largely independent of one another. In each chapter, the author highlights algorithmic aspects of the presented models, i.e., the construction of polynomial-time algorithms for graph coloring. This is an expanded and updated translation of the prizewinning book originally published in Polish, Optymalizacja dyskretna. Modele i metody kolorowania grafow. It is suitable for graduate students and researchers interested in graph theory. |
Ấn bản in khác - Xem tất cả
Tài liệu tham khảo sách này
Intelligent Information Processing and Web Mining: Proceedings of the ... Mieczysław Kłopotek,Slawomir T. Wierzchon Xem trước bị giới hạn - 2005 |