Fast maximum clique algorithms for large graphs.

Ryan A. Rossi|David F. Gleich|Assefaw Hadish Gebremedhin|Md. Mostofa Ali Patwary


Anthology ID:DBLP:conf/www/RossiGGP14
Volume:23rd International World Wide Web Conference, WWW '14, Seoul, Republic of Korea, April 7-11, 2014, Companion Volume
Year:2014
Venue:The Web Conference (WWW)
Publisher:ACM
Pages:365-366
URL:https://doi.org/10.1145/2567948.2577283
DOI:https://doi.org/10.1145/2567948.2577283
DBLP:conf/www/RossiGGP14
BibTeX:
@inproceedings{rossi-2014-fast, author = {Ryan A. Rossi and David F. Gleich and Assefaw Hadish Gebremedhin and Md. Mostofa Ali Patwary}, editor = {Chin-Wan Chung and Andrei Z. Broder and Kyuseok Shim and Torsten Suel}, title = {{Fast maximum clique algorithms for large graphs}}, booktitle = {{23rd International World Wide Web Conference, WWW '14, Seoul, Republic of Korea, April 7-11, 2014, Companion Volume}}, pages = {365--366}, publisher = {ACM}, year = {2014}, url = {https://doi.org/10.1145/2567948.2577283}, doi = {https://doi.org/10.1145/2567948.2577283} }