Mikko Koivisto. An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion. In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings. pages 583-590, IEEE Computer Society, 2006. [doi]
@inproceedings{Koivisto06:1,
title = {An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion},
author = {Mikko Koivisto},
year = {2006},
doi = {10.1109/FOCS.2006.11},
url = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2006.11},
tags = {graph-rewriting, rewriting, partitioning},
researchr = {https://researchr.org/publication/Koivisto06%3A1},
cites = {0},
citedby = {0},
pages = {583-590},
booktitle = {47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
publisher = {IEEE Computer Society},
isbn = {0-7695-2720-5},
}