Natwar Modani, Kuntal Dey. Large maximal cliques enumeration in sparse graphs. In James G. Shanahan, Sihem Amer-Yahia, Ioana Manolescu, Yi Zhang, David A. Evans, Aleksander Kolcz, Key-Sun Choi, Abdur Chowdhury, editors, Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008, Napa Valley, California, USA, October 26-30, 2008. pages 1377-1378, ACM, 2008. [doi]
@inproceedings{ModaniD08, title = {Large maximal cliques enumeration in sparse graphs}, author = {Natwar Modani and Kuntal Dey}, year = {2008}, doi = {10.1145/1458082.1458288}, url = {http://doi.acm.org/10.1145/1458082.1458288}, tags = {graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/ModaniD08}, cites = {0}, citedby = {0}, pages = {1377-1378}, booktitle = {Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008, Napa Valley, California, USA, October 26-30, 2008}, editor = {James G. Shanahan and Sihem Amer-Yahia and Ioana Manolescu and Yi Zhang and David A. Evans and Aleksander Kolcz and Key-Sun Choi and Abdur Chowdhury}, publisher = {ACM}, isbn = {978-1-59593-991-3}, }