Szabó, Sándor and Zavalnij, Bogdan (2018) Decomposing clique search problems into smaller instances based on node and edge colorings. DISCRETE APPLIED MATHEMATICS, 242. pp. 118-129. ISSN 0166-218X
|
Text
1-s2.0-S0166218X18300179-main.pdf Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (397kB) | Preview |
Official URL: http://doi.org/10.1016/j.dam.2018.01.006
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA166-QA166.245 Graphs theory / gráfelmélet |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 09 Oct 2019 07:39 |
| Last Modified: | 09 Oct 2019 07:39 |
| URI: | http://real.mtak.hu/id/eprint/102152 |
Actions (login required)
 |
Edit Item |
