A decomposition approach to solve the selective graph coloring problem in some perfect graph families
| Autor: | Z. Caner Taşkın, Tınaz Ekim, Oylum Şeker |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
050210 logistics & transportation
021103 operations research Computer Networks and Communications Computer science 05 social sciences 0211 other engineering and technologies 02 engineering and technology Combinatorics Hardware and Architecture 0502 economics and business Perfect graph Decomposition (computer science) Graph coloring Integer programming Software Information Systems |
| Zdroj: | Networks. 73:145-169 |
| ISSN: | 0028-3045 |
| DOI: | 10.1002/net.21850 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Plný text