{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:26:29Z","timestamp":1787509589311,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540880660","type":"print"},{"value":"9783540880677","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-88067-7_12","type":"book-chapter","created":{"date-parts":[[2008,10,9]],"date-time":"2008-10-09T00:38:39Z","timestamp":1223512719000},"page":"207-221","source":"Crossref","is-referenced-by-count":14,"title":["Parallel Algorithm for Enumerating Maximal Cliques in Complex Network"],"prefix":"10.1007","author":[{"given":"Nan","family":"Du","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bin","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liutong","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bai","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pei","family":"Xin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R. Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys.\u00a074(1), 47\u201397 (2002)","journal-title":"Rev. Mod. Phys."},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R. Milo","year":"2002","unstructured":"Milo, R., Itzkovitz, S.: Network motifs: Simple building blocks of complex networks. Science\u00a0298, 824\u2013827 (2002)","journal-title":"Science"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Johnson, D.: On generating all maximal independent sets. Information Processing Letter\u00a027(3)","DOI":"10.1016\/0020-0190(88)90065-8"},{"key":"12_CR4","volume-title":"Social Network Analysis: A Handbook","author":"J. Scott","year":"2002","unstructured":"Scott, J.: Social Network Analysis: A Handbook. Sage Publications, London (2002)"},{"key":"12_CR5","unstructured":"Faisal, N., Abu-Khzam.: On the relative efficiency of maximal clique enumeration algorithms, with application to high-throughput computational biology. In: International Conference on Research Trends in Science and Technology, vol. 557"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E. Tomita","year":"2006","unstructured":"Tomita, E.: The worst-case time complexity for generating all maximal cliques. Theoretical Computer Science\u00a0363, 28\u201342 (2006)","journal-title":"Theoretical Computer Science"},{"key":"12_CR7","doi-asserted-by":"publisher","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. Communications of the ACM\u00a016, 575\u2013577 (1973)","journal-title":"Communications of the ACM"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"Tsukiyama, S.: A new algorithm for generating all the maximal independent sets. SIAM Journal on Computing\u00a06, 487\u2013504 (1977)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: 9th Scandinavian Workshop on Algorithm Theory, pp. 260\u2013272","DOI":"10.1007\/978-3-540-27810-8_23"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"1198","DOI":"10.1093\/bioinformatics\/17.12.1198","volume":"17","author":"F. Kose","year":"2001","unstructured":"Kose, F., Weckwerth, W., Linke, T., Fiehn, O.: Visualizing plant metabolomic correlation networks using clique-metabolite matrices. Bioinformatics\u00a017, 1198\u20131208 (2001)","journal-title":"Bioinformatics"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Zeng, Z., Wang, J., Karypis, G.: Coherent closed quasi-clique discovery from large dense graph databases. In: The 12th ACM SIGKDD, pp. 797\u2013802 (2006)","DOI":"10.1145\/1150402.1150506"}],"container-title":["Studies in Computational Intelligence","Mining Complex Data"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88067-7_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:55:37Z","timestamp":1619510137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88067-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540880660","9783540880677"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88067-7_12","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"value":"1860-949X","type":"print"},{"value":"1860-9503","type":"electronic"}],"subject":[]}}