%0 Journal Article %1 journals/dam/SzaboZ18 %A Szabó, Sándor %A Zaválnij, Bogdán %D 2018 %J Discret. Appl. Math. %K dblp %P 118-129 %T Decomposing clique search problems into smaller instances based on node and edge colorings. %U http://dblp.uni-trier.de/db/journals/dam/dam242.html#SzaboZ18 %V 242

@article{journals/dam/SzaboZ18, added-at = {2021-12-25T00:00:00.000+0100}, author = {Szabó, Sándor and Zaválnij, Bogdán}, biburl = {https://www.bibsonomy.org/bibtex/20b397282b905ccd383cd7e2d94ee65c3/dblp}, ee = {https://doi.org/10.1016/j.dam.2018.01.006}, interhash = {74fd38a634abe257ad6a7bdd840b0991}, intrahash = {0b397282b905ccd383cd7e2d94ee65c3}, journal = {Discret. Appl. Math.}, keywords = {dblp}, pages = {118-129}, timestamp = {2024-04-09T01:23:48.000+0200}, title = {Decomposing clique search problems into smaller instances based on node and edge colorings.}, url = {http://dblp.uni-trier.de/db/journals/dam/dam242.html#SzaboZ18}, volume = 242, year = 2018 }