Finding a Maximum Clique in Dense Graphs via χ2 Statistics.

Sourav Dutta|Matthew B. Jones|Juho Lauri|Matthew B. Jones|Juho Lauri


Anthology ID:DBLP:conf/cikm/DuttaL19
Volume:Proceedings of the 28th ACM International Conference on Information and Knowledge Management, CIKM 2019, Beijing, China, November 3-7, 2019.
Year:2019
Venue:International Conference on Information and Knowledge Management (CIKM)
Publisher:ACM
Pages:2421-2424
URL:https://doi.org/10.1145/3357384.3358126
DOI:https://doi.org/10.1145/3357384.3358126
DBLP:conf/cikm/DuttaL19
BibTeX:
@inproceedings{dutta-2019-finding, author = {Sourav Dutta and Matthew B. Jones and Juho Lauri and Matthew B. Jones and Juho Lauri}, editor = {Wenwu Zhu and Dacheng Tao and Xueqi Cheng and Peng Cui and Elke A. Rundensteiner and David Carmel and Qi He and Jeffrey Xu Yu}, title = {{Finding a Maximum Clique in Dense Graphs via χ2 Statistics}}, booktitle = {{Proceedings of the 28th ACM International Conference on Information and Knowledge Management, CIKM 2019, Beijing, China, November 3-7, 2019}}, pages = {2421--2424}, publisher = {ACM}, year = {2019}, url = {https://doi.org/10.1145/3357384.3358126}, doi = {https://doi.org/10.1145/3357384.3358126} }