{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T11:43:51Z","timestamp":1782906231710,"version":"3.54.5"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,3,6]],"date-time":"2012-03-06T00:00:00Z","timestamp":1330992000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s00453-012-9632-8","type":"journal-article","created":{"date-parts":[[2012,3,6]],"date-time":"2012-03-06T01:07:44Z","timestamp":1330996064000},"page":"173-186","source":"Crossref","is-referenced-by-count":51,"title":["Fast Maximal Cliques Enumeration in Sparse Graphs"],"prefix":"10.1007","volume":"66","author":[{"given":"Lijun","family":"Chang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,3,6]]},"reference":[{"issue":"1","key":"9632_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0202001","volume":"2","author":"E.A. Akkoyunlu","year":"1973","unstructured":"Akkoyunlu, E.A.: The enumeration of maximal cliques of large graphs. SIAM J. Comput. 2(1), 1\u20136 (1973)","journal-title":"SIAM J. Comput."},{"issue":"9","key":"9632_CR2","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C. Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Finding all cliques of an undirected graph (algorithm 457). Commun. ACM 16(9), 575\u2013576 (1973)","journal-title":"Commun. ACM"},{"key":"9632_CR3","first-page":"447","volume-title":"SIGMOD","author":"J. Cheng","year":"2010","unstructured":"Cheng, J., Ke, Y., Fu, A.W.-C., Yu, J.X., Zhu, L.: Finding maximal cliques in massive networks by h*-graph. In: SIGMOD, pp. 447\u2013458 (2010)"},{"issue":"1","key":"9632_CR4","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N. Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14(1), 210\u2013223 (1985)","journal-title":"SIAM J. Comput."},{"key":"9632_CR5","first-page":"739","volume-title":"VLDB","author":"S. Cohen","year":"2006","unstructured":"Cohen, S., Fadida, I., Kanza, Y., Kimelfeld, B., Sagiv, Y.: Full disjunctions: Polynomial-delay iterators in action. In: VLDB, pp. 739\u2013750 (2006)"},{"key":"9632_CR6","first-page":"278","volume-title":"WADS","author":"D. Eppstein","year":"2009","unstructured":"Eppstein, D., Spiro, E.S.: The h-index of a graph and its application to dynamic subgraph statistics. In: WADS, pp. 278\u2013289 (2009)"},{"issue":"6","key":"9632_CR7","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1093\/bioinformatics\/17.6.487","volume":"17","author":"E. Harley","year":"2001","unstructured":"Harley, E., Bonner, A.J., Goodman, N.: Uniform integration of genome mapping data using intersection graphs. Bioinformatics 17(6), 487\u2013494 (2001)","journal-title":"Bioinformatics"},{"issue":"3","key":"9632_CR8","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119\u2013123 (1988)","journal-title":"Inf. Process. Lett."},{"issue":"11\u201316","key":"9632_CR9","doi-asserted-by":"crossref","first-page":"1481","DOI":"10.1016\/S1389-1286(99)00040-7","volume":"31","author":"R. Kumar","year":"1999","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Trawling the web for emerging cyber-communities. Comput. Netw. 31(11\u201316), 1481\u20131493 (1999)","journal-title":"Comput. Netw."},{"key":"9632_CR10","first-page":"260","volume-title":"SWAT","author":"K. Makino","year":"2004","unstructured":"Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: SWAT, pp. 260\u2013272 (2004)"},{"key":"9632_CR11","doi-asserted-by":"crossref","first-page":"1377","DOI":"10.1145\/1458082.1458288","volume-title":"CIKM","author":"N. Modani","year":"2008","unstructured":"Modani, N., Dey, K.: Large maximal cliques enumeration in sparse graphs. In: CIKM, pp. 1377\u20131378 (2008)"},{"issue":"3","key":"9632_CR12","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.compbiolchem.2004.03.002","volume":"28","author":"S. Mohseni-Zadeh","year":"2004","unstructured":"Mohseni-Zadeh, S., Br\u00e9zellec, P., Risler, J.-L.: Cluster-c, an algorithm for the large-scale clustering of protein sequences based on the extraction of maximal cliques. Comput. Biol. Chem. 28(3), 211\u2013218 (2004)","journal-title":"Comput. Biol. Chem."},{"issue":"1","key":"9632_CR13","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E. Tomita","year":"2006","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theor. Comput. Sci. 363(1), 28\u201342 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9632_CR14","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6(3), 505\u2013517 (1977)","journal-title":"SIAM J. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9632-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-012-9632-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9632-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:09Z","timestamp":1559137509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-012-9632-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,6]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["9632"],"URL":"https:\/\/doi.org\/10.1007\/s00453-012-9632-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,6]]}}}