Large maximal cliques enumeration in sparse graphs.

Natwar Modani|Kuntal Dey


Anthology ID:DBLP:conf/cikm/ModaniD08
Volume:Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008, Napa Valley, California, USA, October 26-30, 2008
Year:2008
Venue:International Conference on Information and Knowledge Management (CIKM)
Publisher:ACM
Pages:1377-1378
URL:https://doi.org/10.1145/1458082.1458288
DOI:https://doi.org/10.1145/1458082.1458288
DBLP:conf/cikm/ModaniD08
BibTeX:
@inproceedings{modani-2008-large, author = {Natwar Modani and Kuntal Dey}, editor = {James G. Shanahan and Sihem Amer-Yahia and Ioana Manolescu and Yi Zhang and David A. Evans and Alek Kolcz and Key-Sun Choi and Abdur Chowdhury}, title = {{Large maximal cliques enumeration in sparse graphs}}, booktitle = {{Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008, Napa Valley, California, USA, October 26-30, 2008}}, pages = {1377--1378}, publisher = {ACM}, year = {2008}, url = {https://doi.org/10.1145/1458082.1458288}, doi = {https://doi.org/10.1145/1458082.1458288} }