{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:21:50Z","timestamp":1725888110647},"publisher-location":"Singapore","reference-count":10,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811050404"},{"type":"electronic","value":"9789811050411"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-981-10-5041-1_64","type":"book-chapter","created":{"date-parts":[[2017,5,13]],"date-time":"2017-05-13T07:14:39Z","timestamp":1494659679000},"page":"393-398","source":"Crossref","is-referenced-by-count":2,"title":["Detecting Bases of Maximal Cliques in a Graph"],"prefix":"10.1007","author":[{"given":"Fei","family":"Hao","sequence":"first","affiliation":[]},{"given":"Doo-Soon","family":"Park","sequence":"additional","affiliation":[]},{"given":"Zheng","family":"Pei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,14]]},"reference":[{"key":"64_CR1","unstructured":"Conte, A., De Virgilio, R., Maccioni, A., et al.: Finding all maximal cliques in very large social networks. In: Proceedings of EDBT, pp. 173\u2013184 (2016)"},{"issue":"1","key":"64_CR2","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1109\/TSC.2015.2479225","volume":"9","author":"Y Xu","year":"2016","unstructured":"Xu, Y., Cheng, J., Fu, A.W.C.: Distributed maximal clique computation and management. IEEE Trans. Serv. Comput. 9(1), 110\u2013122 (2016)","journal-title":"IEEE Trans. Serv. Comput."},{"key":"64_CR3","doi-asserted-by":"crossref","unstructured":"Modani, N., Dey, K.: Large maximal cliques enumeration in large sparse graphs. In: Proceedings of 15th International Conference on Management of Data, pp. 1377\u20131378 (2009)","DOI":"10.1145\/1458082.1458288"},{"key":"64_CR4","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Loffler, M., Strash, D.: Listing all maximal cliques in sparse graphs in near-optimal time. In: Proceedings of 21st International Symposium on Algorithms and Computation, pp. 403\u2013414 (2010)","DOI":"10.1007\/978-3-642-17517-6_36"},{"key":"64_CR5","doi-asserted-by":"crossref","unstructured":"Cheng, J., Zhu, L., Ke, Y., Chu, S.: Fast algorithms for maximal clique enumeration with limited memory. In: Proceedings of 18th ACM SIGKDD, pp. 1240\u20131248 (2012)","DOI":"10.1145\/2339530.2339724"},{"key":"64_CR6","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Pszona, P.: External-memory network analysis algorithms for naturally sparse graphs. In: Proceedings of 19th Europe Conference on Algorithms, pp. 664\u2013676 (2011)","DOI":"10.1007\/978-3-642-23719-5_56"},{"key":"64_CR7","doi-asserted-by":"crossref","unstructured":"Du, N., Wu, B., Xu, L., Wang, B., Xin, P.: Parallel algorithm for enumerating maximal cliques in complex network. In: Proceedings of Mining Complex Data, pp. 207\u2013221 (2009)","DOI":"10.1007\/978-3-540-88067-7_12"},{"issue":"4","key":"64_CR8","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/j.jpdc.2009.01.003","volume":"69","author":"MC Schmidt","year":"2009","unstructured":"Schmidt, M.C., Samatova, N.F., Thomas, K., Park, B.H.: A scalable, parallel algorithm for maximal clique enumeration. J. Parallel Distrib. Comput. 69(4), 417\u2013428 (2009)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"64_CR9","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1109\/JSYST.2015.2433294","volume":"11","author":"F Hao","year":"2015","unstructured":"Hao, F., Min, G., Pei, Z., et al.: K-clique communities detection in social networks based on formal concept analysis. IEEE Syst. J. 11(1), 250\u2013259 (2015). doi: 10.1109\/JSYST.2015.2433294","journal-title":"IEEE Syst. J."},{"issue":"C","key":"64_CR10","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.neucom.2015.10.141","volume":"209","author":"F Hao","year":"2016","unstructured":"Hao, F., Park, D.S., Min, G., Jeong, Y.S., Park, J.H.: K-clique mining in dynamic social networks based on triadic formal concept analysis. Neurocomputing 209(C), 57\u201366 (2016)","journal-title":"Neurocomputing"}],"container-title":["Lecture Notes in Electrical Engineering","Advanced Multimedia and Ubiquitous Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-5041-1_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T15:07:35Z","timestamp":1692803255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-5041-1_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9789811050404","9789811050411"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-5041-1_64","relation":{},"ISSN":["1876-1100","1876-1119"],"issn-type":[{"type":"print","value":"1876-1100"},{"type":"electronic","value":"1876-1119"}],"subject":[],"published":{"date-parts":[[2017]]}}}