Generalized Graph Colorability and Compressibility of Boolean Formulae

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]

Authors

Richard Nock

This author has not been identified. Look up 'Richard Nock' in Google

Pascal Jappy

This author has not been identified. Look up 'Pascal Jappy' in Google

Jean Sallantin

This author has not been identified. Look up 'Jean Sallantin' in Google