{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T12:38:35Z","timestamp":1723034315746},"reference-count":27,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2015]]},"DOI":"10.1587\/transinf.2014fcp0018","type":"journal-article","created":{"date-parts":[[2015,2,28]],"date-time":"2015-02-28T22:42:17Z","timestamp":1425163337000},"page":"490-496","source":"Crossref","is-referenced-by-count":2,"title":["Faster Enumeration of All Maximal Cliques in Unit Disk Graphs Using Geometric Structure"],"prefix":"10.1587","volume":"E98.D","author":[{"given":"Taisuke","family":"IZUMI","sequence":"first","affiliation":[{"name":"Graduate School of Engineering, Nagoya Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daisuke","family":"SUZUKI","sequence":"additional","affiliation":[{"name":"Graduate School of Engineering, Nagoya Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] A. G\u00e9ly, L. Nourine, and B. Sadi, \u201cEnumeration aspects of maximal cliques and bicliques,\u201d Discrete Appl. Math., vol.157, no.7, pp.1447-1459, 2009.","DOI":"10.1016\/j.dam.2008.10.010"},{"key":"2","unstructured":"[2] The UC Irvine machine learning repository. http:\/\/archive.ics.uci.edu\/ml\/"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] G. Alexe, S. Alexe, Y. Crama, S. Foldes, P.L. Hammer, and B. Simeone, \u201cConsensus algorithms for the generation of all maximal bicliques,\u201d Discrete Appl. Math., vol.145, no.1, pp.11-21, 2004.","DOI":"10.1016\/j.dam.2003.09.004"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] J.G. Augustson and J. Minker, An analysis of some graph theoretical cluster techniques, J. ACM, vol.17, no.4, pp.571-588, 1970.","DOI":"10.1145\/321607.321608"},{"key":"5","unstructured":"[5] N.M. Berry, T.H. Ko, T. Moy, J. Smrcka, J. Turnley, and B. Wu, \u201cEmergent clique formation in terrorist recruitment,\u201d Proc. AAAI-04 Workshop on Agent Organizations, 2004."},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] C. Bron and J. Kerbosch, \u201cFinding all cliques of an undirected graph,\u201d Commun. ACM, vol.16, no.9, pp.575-577, 1973.","DOI":"10.1145\/362342.362367"},{"key":"7","unstructured":"[7] J. Cheng, Y. Ke, A.W.-C. Fu, J.X. Yu, and L. Zhu, \u201cFinding maximal cliques in massive networks by h*-graph,\u201d Proc. 2010 ACM SIGMOD International Conference on Management of Data (SIGMOD), pp.447-458, 2010."},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] J. Cheng, Y. Ke, A.W.-C. Fu, J.X. Yu, and L. Zhu, \u201cFinding maximal cliques in massive networks,\u201d ACM Trans. Database Syst., vol.36, no.4, pp.21: 1-21: 34, 2011.","DOI":"10.1145\/2043652.2043654"},{"key":"9","unstructured":"[9] J. Cheng, L. Zhu, Y. Ke, and S. Chu, \u201cFast algorithms for maximal clique enumeration with limited memory,\u201d Proc. 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.1240-1248, 2012."},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] N. Chiba and T. Nishizeki, \u201cArboricity and subgraph listing algorithms,\u201d SIAM J. Comput., vol.14, no.1, pp.210-223, 1985.","DOI":"10.1137\/0214017"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] B.N. Clark, C.J. Colbourn, and D.S. Johnson, \u201cUnit disk graphs,\u201d Discrete Mathematics, vol.86, no.1-3, pp.165-177, 1990.","DOI":"10.1016\/0012-365X(90)90358-O"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] P. Damaschke, \u201cEnumerating maximal bicliques in bipartite graphs with favorable degree sequences,\u201d Inf. Process. Lett., vol.114, no.6, pp.317-321, 2014.","DOI":"10.1016\/j.ipl.2014.02.001"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] N. Du, B. Wu, X. Pei, B. Wang, and L. Xu, \u201cCommunity detection in large-scale social networks,\u201d Proc. 9th WebKDD and 1st SNA-KDD 2007 Workshop on Web Mining and Social Network Analysis, pp.16-25, 2007.","DOI":"10.1145\/1348549.1348552"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] D. Eppstein, M. L\u00f6ffler, and D. Strash, \u201cListing all maximal cliques in sparse graphs in near-optimal time,\u201d Proc. 21st International Symposium on Algorithms and Computation (ISAAC), pp.403-414, 2010.","DOI":"10.1007\/978-3-642-17517-6_36"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] D. Eppstein and D. Strash, \u201cListing all maximal cliques in large sparse real-world graphs,\u201d Proc. 10th International Conference on Experimental algorithms (SEA), pp.364-375, 2011.","DOI":"10.1007\/978-3-642-20662-7_31"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] E. ETomita, A. Tanaka, and H. Takahashi, \u201cThe worst-case time complexity for generating all maximal cliques and computational experiments,\u201d Theor. Comput. Sci., vol.363, no.1, pp.28-42, 2006.","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] D.S. Johnson and C.H. Papadimitriou, \u201cOn generating all maximal independent sets,\u201d Inf. Process. Lett., vol.27, no.3, pp.119-123, 1988.","DOI":"10.1016\/0020-0190(88)90065-8"},{"key":"18","unstructured":"[18] K.-I. Kawarabayashi and D.R. Wood, \u201cCliques in odd-minor-free graphs,\u201d Proc. 18th Computing: the Australasian Theory Symposium (CATS), pp.133-138, 2012."},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] I. Koch, \u201cEnumerating all connected maximal common subgraphs in two graphs,\u201d Theor. Comput. Sci., vol.250, no.1-2, pp.1-30, 2001.","DOI":"10.1016\/S0304-3975(00)00286-3"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] I. Koch, T. Lengauer, and E. Wanke, \u201cAn algorithm for finding maximal common subtopologies in a set of protein structures,\u201d J. Computational Biology, vol.3, no.2, pp.289-306, 1996.","DOI":"10.1089\/cmb.1996.3.289"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] K. Makino and T. Uno, \u201cNew algorithms for enumerating all maximal cliques,\u201d 9th Scandinavian Workshop on Algorithm Theory (SWAT), pp.260-272, 2004.","DOI":"10.1007\/978-3-540-27810-8_23"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] M.C. Schmidt, N.F. Samatova, K. Thomas, and B.-H. Park, \u201cA scalable, parallel algorithm for maximal clique enumeration,\u201d J. Parallel and Distributed Computing, vol.69, no.4, pp.417-428, 2009.","DOI":"10.1016\/j.jpdc.2009.01.003"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] S. Tsukiyama, M. Ide, M. Ariyoshi, and I. Shirakawa, \u201cA new algorithm for generating all maximal independent sets,\u201d SIAM J. Comput., vol.6, no.3, pp.505-517, 1977.","DOI":"10.1137\/0206036"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] T. Uno, \u201cAn efficient algorithm for solving pseudo clique enumeration problem,\u201d Algorithmica, vol.56, no.1, pp.3-16, 2010.","DOI":"10.1007\/s00453-008-9238-3"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] M. Zaki, S. Parthasarathy, M. Ogihara, and W. Li, \u201cNew algorithms for fast discovery of association rules,\u201d Proc. 3rd Internatilal Conference on Knowledge Discovery and Data Mining, pp.283-286, 1997.","DOI":"10.1007\/978-1-4615-5669-5_1"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] A. Zomorodian, \u201cFast construction of the vietoris-rips complex,\u201d Comput. & Graph., vol.34, no.3, pp.263-271, 2010.","DOI":"10.1016\/j.cag.2010.03.007"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] A. Zomorodian, \u201cThe tidy set: a minimal simplicial set for computing homology of clique complexes,\u201d Proc. Twenty-Sixth Annual Symposium on Computational Geometry (SoCG), pp.257-266, 2010.","DOI":"10.1145\/1810959.1811004"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/3\/E98.D_2014FCP0018\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T12:06:13Z","timestamp":1566389173000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/3\/E98.D_2014FCP0018\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2014fcp0018","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}