{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T10:31:58Z","timestamp":1761129118421,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319035352"},{"type":"electronic","value":"9783319035369"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03536-9_13","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T01:59:42Z","timestamp":1386554382000},"page":"156-169","source":"Crossref","is-referenced-by-count":36,"title":["Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs"],"prefix":"10.1007","author":[{"given":"Bharath","family":"Pattabiraman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md. Mostofa Ali","family":"Patwary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Assefaw H.","family":"Gebremedhin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei-keng","family":"Liao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alok","family":"Choudhary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s10732-012-9196-4","volume":"18","author":"D. Andrade","year":"2012","unstructured":"Andrade, D., Resende, M., Werneck, R.: Fast local search for the maximum independent set problem. Journal of Heuristics\u00a018, 525\u2013547 (2012)","journal-title":"Journal of Heuristics"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1145\/321607.321608","volume":"17","author":"J.G. Augustson","year":"1970","unstructured":"Augustson, J.G., Minker, J.: An analysis of some graph theoretical cluster techniques. J. ACM\u00a017, 571\u2013588 (1970)","journal-title":"J. ACM"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01415983","volume":"34","author":"L. Babel","year":"1990","unstructured":"Babel, L., Tinhofer, G.: A branch and bound algorithm for the maximum clique problem. Mathematical Methods of Operations Research\u00a034, 207\u2013217 (1990)","journal-title":"Mathematical Methods of Operations Research"},{"key":"13_CR4","unstructured":"Batagelj, V., Mrvar, A.: Pajek datasets (2006), \n                    http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/j.csda.2004.02.004","volume":"48","author":"V. Boginski","year":"2005","unstructured":"Boginski, V., Butenko, S., Pardalos, P.M.: Statistical analysis of financial networks. Computational Statistics & Data Analysis\u00a048, 431\u2013443 (2005)","journal-title":"Computational Statistics & Data Analysis"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The Maximum Clique Problem. In: Handbook of Combinatorial Optimization, pp. 1\u201374. Kluwer Academic Publishers (1999)","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1147\/rd.81.0022","volume":"8","author":"R.E. Bonner","year":"1964","unstructured":"Bonner, R.E.: On some clustering techniques. IBM J. Res. Dev.\u00a08, 22\u201332 (1964)","journal-title":"IBM J. Res. Dev."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Brouwer, A.E., Shearer, J.B., Sloane, N.J.A., Smith, W.D.: A new table of constant weight codes. IEEE Transactions on Information Theory, 1334\u20131380 (1990)","DOI":"10.1109\/18.59932"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R. Carraghan","year":"1990","unstructured":"Carraghan, R., Pardalos, P.: An exact algorithm for the maximum clique problem. Oper. Res. Lett.\u00a09, 375\u2013382 (1990)","journal-title":"Oper. Res. Lett."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Faloutsos, C.: Graph mining: Laws, generators, and algorithms, ACM Comput. Surv. 38 (2006)","DOI":"10.1145\/1132952.1132954"},{"key":"13_CR11","first-page":"1","volume":"38","author":"T.A. Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The university of florida sparse matrix collection. ACM Transactions on Mathematical Software (TOMS)\u00a038, 1:1\u20131:25 (2011)","journal-title":"ACM Transactions on Mathematical Software (TOMS)"},{"key":"13_CR12","first-page":"57","volume-title":"Proc. of the 7th ACM SIGKDD KDD 2001, KDD 2001","author":"P. Domingos","year":"2001","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: Proc. of the 7th ACM SIGKDD KDD 2001, KDD 2001, San Francisco, California, pp. 57\u201366. ACM, New York (2001)"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the Internet topology. In: Proc. of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, SIGCOMM 1999, Cambridge, Massachusetts, United States, pp. 251\u2013262. ACM (1999)","DOI":"10.1145\/316194.316229"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"3922","DOI":"10.1016\/j.cma.2008.03.008","volume":"197","author":"M. Ferronato","year":"2008","unstructured":"Ferronato, M., Janna, C., Gambolati, G.: Mixed constraint preconditioning in computational contact mechanics. Computer Methods in Applied Mechanics and Engineering\u00a0197, 3922\u20133931 (2008)","journal-title":"Computer Methods in Applied Mechanics and Engineering"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S. Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Physics Reports\u00a0486, 75\u2013174 (2010)","journal-title":"Physics Reports"},{"key":"13_CR16","unstructured":"Garey, M.R., Johnson, D.S.: W. H. Freeman & Co., New York, NY, USA (1979)"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s10732-007-9055-x","volume":"14","author":"A. Grosso","year":"2008","unstructured":"Grosso, A., Locatelli, M., Pullan, W.: Simple ingredients leading to very efficient heuristics for the maximum clique problem. Journal of Heuristics\u00a014, 587\u2013612 (2008)","journal-title":"Journal of Heuristics"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Gutin, G., Gross, J.L., Yellen, J.: Handbook of graph theory. Discrete Mathematics & Its Applications. CRC Press (2004)","DOI":"10.1201\/9780203490204"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1109\/34.42855","volume":"11","author":"R. Horaud","year":"1989","unstructured":"Horaud, R., Skordas, T.: Stereo correspondence through feature grouping and maximal cliques. IEEE Trans. Pattern Anal. Mach. Intell.\u00a011, 1168\u20131180 (1989)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Johnson, D., Trick, M.A. (eds.): Cliques, coloring and satisfiability: Second dimacs implementation challenge. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol.\u00a026 (1996)","DOI":"10.1090\/dimacs\/026"},{"key":"13_CR21","first-page":"569","volume":"58","author":"J. Konc","year":"2007","unstructured":"Konc, J., Jane\u017ei\u010d, D.: An improved branch and bound algorithm for the maximum clique problem. MATCH Commun. Math. Comput. Chem.\u00a058, 569\u2013590 (2007)","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"13_CR22","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Extracting Large-Scale Knowledge Bases from the Web. In: VLDB 1999, pp. 639\u2013650 (1999)"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1145\/1081870.1081893","volume-title":"Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, KDD 2005","author":"J. Leskovec","year":"2005","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, KDD 2005, Chicago, Illinois, USA, pp. 177\u2013187. ACM, New York (2005)"},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1002\/asi.20732","volume":"59","author":"L. Leydesdorff","year":"2008","unstructured":"Leydesdorff, L.: On the normalization and visualization of author co-citation data: Salton\u2019s cosine versus the jaccard index. J. Am. Soc. Inf. Sci. Technol.\u00a059, 77\u201385 (2008)","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Li, C.-M., Quan, Z.: An efficient branch-and-bound algorithm based on maxsat for the maximum clique problem (2010)","DOI":"10.1609\/aaai.v24i1.7536"},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"5200","DOI":"10.1073\/pnas.0307545100","volume":"101","author":"M.E.J. Newman","year":"2004","unstructured":"Newman, M.E.J.: Coauthorship networks and patterns of scientific collaboration. Proceedings of the National Academy of Sciences of the United States of America\u00a0101, 5200\u20135205 (2004)","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"13_CR27","unstructured":"Niskanen, S., \u00d6sterg\u00e5rd, P.R.J.: Cliquer user\u2019s guide, version 1.0, Tech. Rep. T48, Communications Laboratory, Helsinki University of Technology, Espoo, Finland (2003)"},{"key":"13_CR28","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"P.R.J. \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd, P.R.J.: A fast algorithm for the maximum clique problem. Discrete Appl. Math.\u00a0120, 197\u2013207 (2002)","journal-title":"Discrete Appl. Math."},{"key":"13_CR29","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G. Palla","year":"2005","unstructured":"Palla, G., Derenyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature\u00a0435, 814\u2013818 (2005)","journal-title":"Nature"},{"key":"13_CR30","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"P.M. Pardalos","year":"1994","unstructured":"Pardalos, P.M., Xue, J.: The maximum clique problem. Journal of Global Optimization\u00a04, 301\u2013328 (1994)","journal-title":"Journal of Global Optimization"},{"key":"13_CR31","first-page":"145","volume-title":"Proc. of the 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2003","author":"M. Pavan","year":"2003","unstructured":"Pavan, M., Pelillo, M.: A new graph-theoretic approach to clustering and segmentation. In: Proc. of the 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2003, pp. 145\u2013152. IEEE Computer Society, Washington, DC (2003)"},{"key":"13_CR32","doi-asserted-by":"crossref","unstructured":"Prosser, P.: Exact algorithms for maximum clique: A computational study, arXiv preprint arXiv:1207.4616v1 (2012)","DOI":"10.3390\/a5040545"},{"key":"13_CR33","doi-asserted-by":"crossref","unstructured":"Sadi, S., \u00d6\u011f\u00fcd\u00fcc\u00fc, S., Uyar, A.S.: An efficient community detection method using parallel clique-finding ants. In: Proc. of IEEE Congress on Evol. Comp., pp. 1\u20137 (July 2010)","DOI":"10.1109\/CEC.2010.5586496"},{"key":"13_CR34","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/j.cor.2010.07.019","volume":"38","author":"P. San Segundo","year":"2011","unstructured":"San Segundo, P., Rodr\u00edguez-Losada, D., Jim\u00e9nez, A.: An exact bit-parallel algorithm for the maximum clique problem. Comput. Oper. Res.\u00a038, 571\u2013581 (2011)","journal-title":"Comput. Oper. Res."},{"key":"13_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-45066-1_22","volume-title":"Discrete Mathematics and Theoretical Computer Science","author":"E. Tomita","year":"2003","unstructured":"Tomita, E., Seki, T.: An efficient branch-and-bound algorithm for finding a maximum clique. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds.) DMTCS 2003. LNCS, vol.\u00a02731, pp. 278\u2013289. Springer, Heidelberg (2003)"},{"key":"13_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-11440-3_18","volume-title":"WALCOM: Algorithms and Computation","author":"E. Tomita","year":"2010","unstructured":"Tomita, E., Sutani, Y., Higashi, T., Takahashi, S., Wakatsuki, M.: A simple and faster branch-and-bound algorithm for finding a maximum clique. In: Rahman, M. S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol.\u00a05942, pp. 191\u2013203. Springer, Heidelberg (2010)"},{"key":"13_CR37","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1186\/1471-2105-10-205","volume":"10","author":"T. Matsunaga","year":"2009","unstructured":"Matsunaga, T., Yonemori, C., Tomita, E., Muramatsu, M.: Clique-based data mining for related genes in a biomedical database. BMC Bioinformatics\u00a010, 205 (2009)","journal-title":"BMC Bioinformatics"},{"key":"13_CR38","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0196-6774(88)90005-3","volume":"9","author":"J. Turner","year":"1988","unstructured":"Turner, J.: Almost all k-colorable graphs are easy to color. Journal of Algorithms\u00a09, 63\u201382 (1988)","journal-title":"Journal of Algorithms"},{"key":"13_CR39","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0021-9290(95)80008-5","volume":"28","author":"B. van Rietbergen","year":"1995","unstructured":"van Rietbergen, B., Weinans, H., Huiskes, R., Odgaard, A.: A new method to determine trabecular bone elastic properties and loading using micromechanical finite-element models. Journal of Biomechanics\u00a028, 69\u201381 (1995)","journal-title":"Journal of Biomechanics"},{"key":"13_CR40","doi-asserted-by":"publisher","first-page":"3370","DOI":"10.1016\/j.ins.2009.05.023","volume":"179","author":"L. Wang","year":"2009","unstructured":"Wang, L., Zhou, L., Lu, J., Yip, J.: An order-clique-based approach for mining maximal co-locations. Information Sciences\u00a0179, 3370\u20133382 (2009)","journal-title":"Information Sciences"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03536-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T09:16:15Z","timestamp":1676366175000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-03536-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319035352","9783319035369"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03536-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}