{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:13:26Z","timestamp":1761894806530,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":6,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,10,26]],"date-time":"2008-10-26T00:00:00Z","timestamp":1224979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,10,26]]},"DOI":"10.1145\/1458082.1458288","type":"proceedings-article","created":{"date-parts":[[2008,11,11]],"date-time":"2008-11-11T12:59:40Z","timestamp":1226408380000},"page":"1377-1378","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["Large maximal cliques enumeration in sparse graphs"],"prefix":"10.1145","author":[{"given":"Natwar","family":"Modani","sequence":"first","affiliation":[{"name":"IBM India Research Lab, New Delhi, India"}]},{"given":"Kuntal","family":"Dey","sequence":"additional","affiliation":[{"name":"IBM India Research Lab, New Delhi, India"}]}],"member":"320","published-online":{"date-parts":[[2008,10,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202001"},{"key":"e_1_3_2_1_2_1","volume-title":"A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically. Computing by Springer-Verlog, 27:349--366","author":"Loukakis E.","year":"1981","unstructured":"E. Loukakis and C. Tsouros . A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically. Computing by Springer-Verlog, 27:349--366 , 1981 . E. Loukakis and C. Tsouros. A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically. Computing by Springer-Verlog, 27:349--366, 1981."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27810-8_23"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00985661"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/0206036"}],"event":{"name":"CIKM08: Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","ACM Association for Computing Machinery","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Napa Valley California USA","acronym":"CIKM08"},"container-title":["Proceedings of the 17th ACM conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1458082.1458288","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1458082.1458288","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:34Z","timestamp":1750253374000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1458082.1458288"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,26]]},"references-count":6,"alternative-id":["10.1145\/1458082.1458288","10.1145\/1458082"],"URL":"https:\/\/doi.org\/10.1145\/1458082.1458288","relation":{},"subject":[],"published":{"date-parts":[[2008,10,26]]},"assertion":[{"value":"2008-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}