{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:29:34Z","timestamp":1765355374148},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540770169"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77018-3_47","type":"book-chapter","created":{"date-parts":[[2007,11,26]],"date-time":"2007-11-26T07:46:39Z","timestamp":1196063199000},"page":"476-483","source":"Crossref","is-referenced-by-count":26,"title":["A Parallel Algorithm for Enumerating All the Maximal k-Plexes"],"prefix":"10.1007","author":[{"given":"Bin","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Pei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"S.B. Seidman","year":"1978","unstructured":"Seidman, S.B., Foster, B.L.: A graph theoretic generalization of the clique concept. Journal of Mathematical Sociology\u00a06, 139\u2013154 (1978)","journal-title":"Journal of Mathematical Sociology"},{"key":"47_CR2","unstructured":"Balasundaram, B., Butenko, S., Hicks, I.V., Sachdeva, S.: Clique Relaxations in Social Network Analysis: The Maximum k-plex Problem (2006), \n                      \n                        http:\/\/ie.tamu.edu\/people\/faculty\/Hicks"},{"key":"47_CR3","unstructured":"Hanneman, R.: Introduction to Social Network, Methods (1998), \n                      \n                        http:\/\/faculty.ucr.edu\/~hanneman\/networks\/nettext.pdf"},{"issue":"9","key":"47_CR4","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":"47_CR5","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1080\/0022250X.1973.9989826","volume":"3","author":"R. Alba","year":"1973","unstructured":"Alba, R.: A graph-theoretic definition of a sociometric clique. Journal of Mathematical Sociology\u00a03, 113\u2013126 (1973)","journal-title":"Journal of Mathematical Sociology"}],"container-title":["Lecture Notes in Computer Science","Emerging Technologies in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77018-3_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:53:42Z","timestamp":1619520822000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77018-3_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540770169"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77018-3_47","relation":{},"subject":[]}}