Richard Nock, Pascal Jappy, Jean Sallantin. Generalized Graph Colorability and Compressibility of Boolean Formulae. In Kyung-Yong Chwa, Oscar H. Ibarra, editors, Algorithms and Computation, 9th International Symposium, ISAAC 98, Taejon, Korea, December 14-16, 1998, Proceedings. Volume 1533 of Lecture Notes in Computer Science, pages 237-246, Springer, 1998. [doi]
@inproceedings{NockJS98,
title = {Generalized Graph Colorability and Compressibility of Boolean Formulae},
author = {Richard Nock and Pascal Jappy and Jean Sallantin},
year = {1998},
url = {http://link.springer.de/link/service/series/0558/bibs/1533/15330237.htm},
tags = {graph-rewriting, rewriting, Pascal},
researchr = {https://researchr.org/publication/NockJS98},
cites = {0},
citedby = {0},
pages = {237-246},
booktitle = {Algorithms and Computation, 9th International Symposium, ISAAC 98, Taejon, Korea, December 14-16, 1998, Proceedings},
editor = {Kyung-Yong Chwa and Oscar H. Ibarra},
volume = {1533},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-65385-6},
}