{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:27:29Z","timestamp":1750220849206,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,3]],"date-time":"2019-11-03T00:00:00Z","timestamp":1572739200000},"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":[[2019,11,3]]},"DOI":"10.1145\/3357384.3358126","type":"proceedings-article","created":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T14:11:35Z","timestamp":1572876695000},"page":"2421-2424","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Finding a Maximum Clique in Dense Graphs via \u03c72 Statistics"],"prefix":"10.1145","author":[{"given":"Sourav","family":"Dutta","sequence":"first","affiliation":[{"name":"Eaton Corp., Dublin, Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juho","family":"Lauri","sequence":"additional","affiliation":[{"name":"Nokia Bell Labs, Dublin, Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,11,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/321607.321608"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2004.02.004"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.81.0022"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(90)90057-C"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"J. Cheng L. Zhu Y. Ke and S. Chu. 2012. Fast Algorithms for Maximal Clique Enumeration with Limited Memory. In SIGKDD. 1240--1248.  J. Cheng L. Zhu Y. Ke and S. Chu. 2012. Fast Algorithms for Maximal Clique Enumeration with Limited Memory. In SIGKDD. 1240--1248.","DOI":"10.1145\/2339530.2339724"},{"key":"e_1_3_2_1_6_1","unstructured":"G. Csardi and T. Nepusz. 2006. The igraph Software Package for Complex Network Research. InterJournal Vol. Complex Systems (2006) 1695.  G. Csardi and T. Nepusz. 2006. The igraph Software Package for Complex Network Research. InterJournal Vol. Complex Systems (2006) 1695."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"S. Dutta P. Nayek and A. Bhattacharya. 2017. Neighbor-Aware Search for Apprx. Labeled Graph Matching using the \u03c7^2$ Statistics. In WWW. 1281--1290.  S. Dutta P. Nayek and A. Bhattacharya. 2017. Neighbor-Aware Search for Apprx. Labeled Graph Matching using the \u03c7^2$ Statistics. In WWW. 1281--1290.","DOI":"10.1145\/3038912.3052561"},{"key":"e_1_3_2_1_8_1","first-page":"403","article-title":"Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. Algo","volume":"6506","author":"Eppstein D.","year":"2010","unstructured":"D. Eppstein , M. L\u00f6ffler , and D. Strash . 2010 . Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. Algo . and Comp. , Vol. 6506 (2010), 403 -- 414 . D. Eppstein, M. L\u00f6ffler, and D. Strash. 2010. Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. Algo. and Comp., Vol. 6506 (2010), 403--414.","journal-title":"and Comp."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On Random Graphs","volume":"6","author":"ErdHos A.","year":"1959","unstructured":"A. ErdHos , P.; R\u00e9nyi. 1959 . On Random Graphs . I. Publicationes Mathematicae , Vol. 6 (1959), 290 -- 297 . A. ErdHos, P.; R\u00e9nyi. 1959. On Random Graphs. I. Publicationes Mathematicae, Vol. 6 (1959), 290--297.","journal-title":"I. Publicationes Mathematicae"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"R.M. Karp. 1972. Reducibility among Combinatorial Problems. In Complexity of Computer Computations. 85--103.  R.M. Karp. 1972. Reducibility among Combinatorial Problems. In Complexity of Computer Computations. 85--103.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_1_12_1","first-page":"569","article-title":"An Improved Branch and Bound Algo. for the Max","volume":"58","author":"Konc J.","year":"2007","unstructured":"J. Konc and D. Janezic . 2007 . An Improved Branch and Bound Algo. for the Max . Clique Problem. Comm. in Math. and in Comp. Chem. , Vol. 58 , 3 (2007), 569 -- 590 . J. Konc and D. Janezic. 2007. An Improved Branch and Bound Algo. for the Max. Clique Problem. Comm. in Math. and in Comp. Chem., Vol. 58, 3 (2007), 569--590.","journal-title":"Clique Problem. Comm. in Math. and in Comp. Chem."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"T. Lappas K. Liu and E. Terzi. 2009. Finding a Team of Experts in Social Networks. In KDD. 467--476.  T. Lappas K. Liu and E. Terzi. 2009. Finding a Team of Experts in Social Networks. In KDD. 467--476.","DOI":"10.1145\/1557019.1557074"},{"key":"e_1_3_2_1_14_1","unstructured":"K. Leung and C. Leckie. 2005. Unsupervised Anomaly Detection in Network Intrusion Detection using Clusters. In ACSC. 333--342.  K. Leung and C. Leckie. 2005. Unsupervised Anomaly Detection in Network Intrusion Detection using Clusters. In ACSC. 333--342."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.02.017"},{"key":"e_1_3_2_1_16_1","first-page":"1538","article-title":"Finding the Maximum Clique in Massive Graphs","volume":"10","author":"Lu C.","year":"2017","unstructured":"C. Lu , J.X. Yu , H. Wei , and Y. Zhang . 2017 . Finding the Maximum Clique in Massive Graphs . VLDB , Vol. 10 , 11 (2017), 1538 -- 1549 . C. Lu, J.X. Yu, H. Wei, and Y. Zhang. 2017. Finding the Maximum Clique in Massive Graphs. VLDB, Vol. 10, 11 (2017), 1538--1549.","journal-title":"VLDB"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.3390\/a6040618"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature03607"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2014.986778"},{"volume-title":"Goodness-of-fit Statistics for Discrete Multivariate Data","author":"Read T.R.C.","key":"e_1_3_2_1_20_1","unstructured":"T.R.C. Read and N.A.C. Cressie . 1988. Goodness-of-fit Statistics for Discrete Multivariate Data . Springer Series in Statistics. T.R.C. Read and N.A.C. Cressie. 1988. Goodness-of-fit Statistics for Discrete Multivariate Data .Springer Series in Statistics."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.2307\/1403582"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"R.A. Rossi and N.K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. In AAAI. 4292--4293.  R.A. Rossi and N.K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. In AAAI. 4292--4293.","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/14100018X"},{"volume-title":"IEEE Congress on Evo. Comp. 1--7.","author":"Sadi S.","key":"e_1_3_2_1_24_1","unstructured":"S. Sadi , S. Oguducu , and A.S. Uyar . 2010. An Eff. Community Detection Method using Parallel Clique Finding Ants . In IEEE Congress on Evo. Comp. 1--7. S. Sadi, S. Oguducu, and A.S. Uyar. 2010. An Eff. Community Detection Method using Parallel Clique Finding Ants. In IEEE Congress on Evo. Comp. 1--7."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.07.019"},{"key":"e_1_3_2_1_26_1","volume-title":"Network Structure and Minimum Degree. Social networks","author":"Seidman S. B.","year":"1983","unstructured":"S. B. Seidman . 1983. Network Structure and Minimum Degree. Social networks , Vol. 5 ( 1983 ), 269--287. S. B. Seidman. 1983. Network Structure and Minimum Degree. Social networks, Vol. 5 (1983), 269--287."},{"key":"e_1_3_2_1_27_1","volume-title":"Finding all maximal cliques in dynamic graphs. Computational Optimization and applications","author":"Stix V.","year":"2004","unstructured":"V. Stix . 2004. Finding all maximal cliques in dynamic graphs. Computational Optimization and applications , Vol. 27 ( 2004 ), 173--186. V. Stix. 2004. Finding all maximal cliques in dynamic graphs. Computational Optimization and applications, Vol. 27 (2004), 173--186."},{"key":"e_1_3_2_1_28_1","first-page":"177","article-title":"Des Valeurs Moyennes","volume":"12","author":"Tchebichef P.","year":"1867","unstructured":"P. Tchebichef . 1867 . Des Valeurs Moyennes . Journal de Math\u00e9matiques Pures et Appliquees , Vol. 12 ( 1867), 177 -- 184 . P. Tchebichef. 1867. Des Valeurs Moyennes. Journal de Math\u00e9matiques Pures et Appliquees, Vol. 12 ( 1867), 177--184.","journal-title":"Journal de Math\u00e9matiques Pures et Appliquees"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.2197\/ipsjjip.25.667"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"E. Tomita and T. Seki. 2003. An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique. In Discrete Math. and The. Computer Sc. 278--289.  E. Tomita and T. Seki. 2003. An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique. In Discrete Math. and The. Computer Sc. 278--289.","DOI":"10.1007\/3-540-45066-1_22"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"E. Tomita Y. Sutani T. Higashi S. Takahashi and M. Wakatsuki. 2010. A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. In WALCOM. 191--203.  E. Tomita Y. Sutani T. Higashi S. Takahashi and M. Wakatsuki. 2010. A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. In WALCOM. 191--203.","DOI":"10.1007\/978-3-642-11440-3_18"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311909"},{"key":"e_1_3_2_1_33_1","unstructured":"J. Xiang C. Guo and A. Aboulnaga. 2013. Scalable Maximum Clique Computation using Map-Reduce. In ICDE. 74--85.  J. Xiang C. Guo and A. Aboulnaga. 2013. Scalable Maximum Clique Computation using Map-Reduce. In ICDE. 74--85."},{"key":"e_1_3_2_1_34_1","volume-title":"Max-clique: A top-down Graph-based Approach to Frequent Pattern Mining. In ICDM. 1139--1144.","author":"Xie Y.","year":"2010","unstructured":"Y. Xie and P.S. Yu . 2010 . Max-clique: A top-down Graph-based Approach to Frequent Pattern Mining. In ICDM. 1139--1144. Y. Xie and P.S. Yu. 2010. Max-clique: A top-down Graph-based Approach to Frequent Pattern Mining. In ICDM. 1139--1144."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0306752101"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Z. Zeng J. Wang L. Zhou and G. Karypis. 2006. Coherent Closed Quasi-clique Discovery from Large Dense Graph Databases. In KDD. 797--802.  Z. Zeng J. Wang L. Zhou and G. Karypis. 2006. Coherent Closed Quasi-clique Discovery from Large Dense Graph Databases. In KDD. 797--802.","DOI":"10.1145\/1150402.1150506"},{"key":"e_1_3_2_1_37_1","first-page":"441","article-title":"A Clique-based and Degree-based Clustering Alg. for Expressway Net","volume":"12","author":"Zhang Z.","year":"2013","unstructured":"Z. Zhang and H. Wang . 2013 . A Clique-based and Degree-based Clustering Alg. for Expressway Net . Simp. Prob. WSEAS Trans. on Comp. , Vol. 12 (2013), 441 -- 448 . Z. Zhang and H. Wang. 2013. A Clique-based and Degree-based Clustering Alg. for Expressway Net. Simp. Prob. WSEAS Trans. on Comp., Vol. 12 (2013), 441--448.","journal-title":"Simp. Prob. WSEAS Trans. on Comp."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jplph.2010.09.010"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"D. Zuckermann. 2006. Linear Degree Extractors and the Inapproximability of Max. Clique and Chromatic Number. In STOC. 681--690.  D. Zuckermann. 2006. Linear Degree Extractors and the Inapproximability of Max. Clique and Chromatic Number. In STOC. 681--690.","DOI":"10.1145\/1132516.1132612"}],"event":{"name":"CIKM '19: The 28th ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Beijing China","acronym":"CIKM '19"},"container-title":["Proceedings of the 28th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357384.3358126","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357384.3358126","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:10Z","timestamp":1750202590000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357384.3358126"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,3]]},"references-count":39,"alternative-id":["10.1145\/3357384.3358126","10.1145\/3357384"],"URL":"https:\/\/doi.org\/10.1145\/3357384.3358126","relation":{},"subject":[],"published":{"date-parts":[[2019,11,3]]},"assertion":[{"value":"2019-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}