دورية أكاديمية
Decomposing clique search problems into smaller instances based on node and edge colorings
العنوان: | Decomposing clique search problems into smaller instances based on node and edge colorings |
---|---|
المؤلفون: | Szabó, Sándor, Zavalnij, Bogdan |
المصدر: | In Discrete Applied Mathematics 19 June 2018 242:118-129 |
قاعدة البيانات: | ScienceDirect |
تدمد: | 0166218X |
---|---|
DOI: | 10.1016/j.dam.2018.01.006 |