{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:33:52Z","timestamp":1725543232884},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540370253"},{"type":"electronic","value":"9783540370260"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11811305_67","type":"book-chapter","created":{"date-parts":[[2006,7,26]],"date-time":"2006-07-26T09:30:33Z","timestamp":1153906233000},"page":"606-617","source":"Crossref","is-referenced-by-count":7,"title":["A New Algorithm for Enumerating All Maximal Cliques in Complex Network"],"prefix":"10.1007","author":[{"given":"Li","family":"Wan","sequence":"first","affiliation":[]},{"given":"Bin","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Nan","family":"Du","sequence":"additional","affiliation":[]},{"given":"Qi","family":"Ye","sequence":"additional","affiliation":[]},{"given":"Ping","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"67_CR1","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Yanakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Info. Proc. Lett.\u00a027, 119\u2013123 (1988)","journal-title":"Info. Proc. Lett."},{"key":"67_CR2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.1975.5.3.237","volume":"5","author":"R.C. Read","year":"1975","unstructured":"Read, R.C., Tarjan, R.E.: Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks\u00a05, 237\u2013252 (1975)","journal-title":"Networks"},{"key":"67_CR3","doi-asserted-by":"publisher","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.\u00a06, 505\u2013517 (1977)","journal-title":"SIAM J. Comput."},{"key":"67_CR4","first-page":"62","volume-title":"Proc. AAAI 2002","author":"T. Eiter","year":"2002","unstructured":"Eiter, T., Makino, K.: On computing all abductive explanations. In: Proc. AAAI 2002, pp. 62\u201367. AAAI Press, Menlo Park (2002)"},{"key":"67_CR5","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0004-3702(94)00069-7","volume":"82","author":"B. Selman","year":"1996","unstructured":"Selman, B., Levesque, H.J.: Support set selection for abductive and default reasoning. Artif. Int.\u00a082, 259\u2013272 (1996)","journal-title":"Artif. Int."},{"key":"67_CR6","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proc. VLDB 1994, pp. 487\u2013499 (1994)"},{"key":"67_CR7","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"R. Agrowal","year":"1996","unstructured":"Agrowal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307\u2013328. MIT Press, Cambridge (1996)"},{"key":"67_CR8","doi-asserted-by":"crossref","unstructured":"Kumar, S.R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Trawling the web for emerging cyber-communities. In: Proc. the Eighth International World Wide Web Conference, Toronto, Canada (1999)","DOI":"10.1016\/S1389-1286(99)00040-7"},{"key":"67_CR9","unstructured":"Abu-Khzam, F.N., Baldwin, N.E., Langston, M.A., Samatova, N.F.: On the relative efficiency of maximal clique enumeration algorithms, with application to High-Throughput computational biology. In: Proceedings, International Conference on Research Trends in Science and Technology, Beirut, Lebanon (2005)"},{"key":"67_CR10","volume-title":"Handbook of Combinatorial Optimizatio","author":"I. Bomze","year":"1999","unstructured":"Bomze, I., Budinich, M., Pardalos, P., Pelillo, M.: The maximum clique problem. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimizatio, vol.\u00a04, Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"67_CR11","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"R.J. Patric","year":"2002","unstructured":"Patric, R.J.: A fast algorithm for the maximum clique problem. Discrete Applied Mathematics\u00a0120, 197\u2013207 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"67_CR12","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":"67_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-27798-9_19","volume-title":"Computing and Combinatorics","author":"E. Tomita","year":"2004","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol.\u00a03106, pp. 161\u2013170. Springer, Heidelberg (2004)"},{"issue":"9","key":"67_CR14","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C. Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: Finding all cliques of an undirected graph. Proceedings of the ACM\u00a016(9), 575\u2013577 (1973)","journal-title":"Proceedings of the ACM"},{"key":"67_CR15","doi-asserted-by":"crossref","unstructured":"Tsukiyama, S., Ariyoshi, H., Shirakawa, I.: A New Algorithm for Generating all the Maximal Independent sets. SIAM J. Comput.\u00a06(3) (September 1977)","DOI":"10.1137\/0206036"},{"key":"67_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-27810-8_23","volume-title":"Algorithm Theory - SWAT 2004","author":"K. Makino","year":"2004","unstructured":"Makino, K., Uno, T.: New Algorithms for Enumerating All Maximal Cliques. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 260\u2013272. Springer, Heidelberg (2004)"},{"key":"67_CR17","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\u2013metabolite matrices. Bioinformatics\u00a017, 1198\u20131208 (2001)","journal-title":"Bioinformatics"},{"key":"67_CR18","unstructured":"Yanhui, W., Bin, W., Bai, W.: Research on Static Measures of Telecom Society Network (in Chinese). Complex Systems and Complexity Science\u00a02(2) (2005)"},{"key":"67_CR19","doi-asserted-by":"crossref","unstructured":"Getoor, L., Diehl, C.P.: Link Mining:A Survey. Newsletter of the ACM Special Interest Group on Knowledge Discovery and Data Mining\u00a07(2) (September 2005)","DOI":"10.1145\/1117454.1117455"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11811305_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T04:11:13Z","timestamp":1555733473000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11811305_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540370253","9783540370260"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11811305_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}