{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T05:13:02Z","timestamp":1784178782229,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,4,7]],"date-time":"2014-04-07T00:00:00Z","timestamp":1396828800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,4,7]]},"DOI":"10.1145\/2567948.2577283","type":"proceedings-article","created":{"date-parts":[[2016,2,5]],"date-time":"2016-02-05T19:44:31Z","timestamp":1454701471000},"page":"365-366","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":65,"title":["Fast maximum clique algorithms for large graphs"],"prefix":"10.1145","author":[{"given":"Ryan A.","family":"Rossi","sequence":"first","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David F.","family":"Gleich","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Assefaw H.","family":"Gebremedhin","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Md. Mostofa Ali","family":"Patwary","sequence":"additional","affiliation":[{"name":"Northwestern University, Evanston, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,4,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39611-6_23"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.3697996"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00290-6"},{"key":"e_1_3_2_1_4_1","volume-title":"Path lengths, correlations, and centrality in temporal networks. arXiv, page 1101.5913v2","author":"Pan R. K.","year":"2011","unstructured":"R. K. Pan and J. Saramaki . Path lengths, correlations, and centrality in temporal networks. arXiv, page 1101.5913v2 , 2011 . R. K. Pan and J. Saramaki. Path lengths, correlations, and centrality in temporal networks. arXiv, page 1101.5913v2, 2011."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03536-9_13"},{"key":"e_1_3_2_1_6_1","first-page":"1","volume-title":"Parallel maximum clique algorithms with applications to network analysis and storage. arXiv preprint arXiv:1302.6256","author":"Rossi R.","year":"2013","unstructured":"R. Rossi , D. Gleich , A. Gebremedhin , M. Patwary , and M. Ali . Parallel maximum clique algorithms with applications to network analysis and storage. arXiv preprint arXiv:1302.6256 , pages 1 -- 10 , 2013 . R. Rossi, D. Gleich, A. Gebremedhin, M. Patwary, and M. Ali. Parallel maximum clique algorithms with applications to network analysis and storage. arXiv preprint arXiv:1302.6256, pages 1--10, 2013."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-006-9039-7"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544815"}],"event":{"name":"WWW '14: 23rd International World Wide Web Conference","location":"Seoul Korea","acronym":"WWW '14","sponsor":["IW3C2 International World Wide Web Conference Committee","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the 23rd International Conference on World Wide Web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2567948.2577283","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2567948.2577283","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:57Z","timestamp":1750232097000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2567948.2577283"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,7]]},"references-count":8,"alternative-id":["10.1145\/2567948.2577283","10.1145\/2567948"],"URL":"https:\/\/doi.org\/10.1145\/2567948.2577283","relation":{},"subject":[],"published":{"date-parts":[[2014,4,7]]},"assertion":[{"value":"2014-04-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}