{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T06:12:29Z","timestamp":1740809549033,"version":"3.38.0"},"reference-count":17,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2025,3,1]]},"DOI":"10.1587\/transinf.2024fcp0005","type":"journal-article","created":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T22:12:19Z","timestamp":1720649539000},"page":"208-213","source":"Crossref","is-referenced-by-count":0,"title":["Space-Efficient FPT Algorithms for Degeneracy"],"prefix":"10.1587","volume":"E108.D","author":[{"given":"Naohito","family":"MATSUMOTO","sequence":"first","affiliation":[{"name":"Seikei University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhiro","family":"KURITA","sequence":"additional","affiliation":[{"name":"Nagoya University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masashi","family":"KIYOMI","sequence":"additional","affiliation":[{"name":"Seikei University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] D.R. Lick and A.T. White, \u201c<i>k<\/i>-degenerate graphs,\u201d Canadian Journal of Mathematics, vol.22, no.5, pp.1082-1096, 1970. 10.4153\/cjm-1970-125-1","DOI":"10.4153\/CJM-1970-125-1"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] D. Eppstein, M. L\u00f6ffler, and D. Strash, \u201cListing all maximal cliques in large sparse real-world graphs,\u201d ACM J. Exp. Algorithmics, vol.18, nov 2013. 10.1145\/2543629","DOI":"10.1145\/2543629"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] A. Conte, T. De Matteis, D. De Sensi, R. Grossi, A. Marino, and L. Versari, \u201cD2k: Scalable community detection in massive networks via small-diameter k-plexes,\u201d Proc. 24th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining, KDD \u201918, New York, NY, USA, pp.1272-1281, Association for Computing Machinery, 2018. 10.1145\/3219819.3220093","DOI":"10.1145\/3219819.3220093"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] C.C. Aggarwal and H. Wang, eds., Managing and mining graph data, Springer, 2010. 10.1007\/978-1-4419-6045-0","DOI":"10.1007\/978-1-4419-6045-0"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] A. Conte, R. Grossi, A. Marino, and L. Versari, \u201cSublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques,\u201d Proc. ICALP 2016, LIPIcs, vol.55, pp.148:1-148:15, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2016. 10.1007\/s00453-019-00656-8","DOI":"10.1007\/s00453-019-00656-8"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] K. Makino and T. Uno, \u201cNew algorithms for enumerating all maximal cliques,\u201d Proc. SWAT 2004, Lecture Notes in Computer Science, vol.3111, pp.260-272, Springer, 2004. 10.1007\/978-3-540-27810-8_23","DOI":"10.1007\/978-3-540-27810-8_23"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] C. Bron and J. Kerbosch, \u201cAlgorithm 457: Finding all cliques of an undirected graph,\u201d Commun. ACM, vol.16, no.9, pp.575-577, Sept. 1973. 10.1145\/362342.362367","DOI":"10.1145\/362342.362367"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] S.B. Seidman, \u2018Network structure and minimum degree,\u2019\u2019 Social Network, vol.5, no.3, pp.269-287, 1983. 10.1016\/0378-8733(83)90028-x","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] X. Liao, Q. Liu, J. Jiang, X. Huang, J. Xu, and B. Choi, \u201cDistributed d-core decomposition over large directed graphs,\u201d Proc. VLDB Endow., vol.15, no.8, pp.1546-1558, 2022. 10.14778\/3529337.3529340","DOI":"10.14778\/3529337.3529340"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] D.W. Matula and L.L. Beck, \u201cSmallest-last ordering and clustering and graph coloring algorithms,\u201d J. ACM, vol.30, no.3, pp.417-427, July 1983. 10.1145\/2402.322385","DOI":"10.1145\/2402.322385"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] V. King, A. Thomo, and Q. Yong, \u201cComputing (1+epsilon)-approximate degeneracy in sublinear time,\u201d Proc. Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI-23, ed. E. Elkind, pp.2160-2168, International Joint Conferences on Artificial Intelligence Organization, Main Track, Aug. 2023. 10.24963\/ijcai.2023\/240","DOI":"10.24963\/ijcai.2023\/240"},{"key":"12","unstructured":"[12] H. Esfandiari, S. Lattanzi, and V. Mirrokni, \u201cParallel and streaming algorithms for k-core decomposition,\u201d Proc. 35th International Conference on Machine Learning, ed. J. Dy and A. Krause, Proc. Machine Learning Research, vol.80, pp.1397-1406, PMLR, July 2018."},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] J. Cheng, Y. Ke, S. Chu, and M.T. \u00d6zsu, \u201cEfficient core decomposition in massive networks,\u201d 2011 IEEE 27th International Conference on Data Engineering, pp.51-62, 2011. 10.1109\/icde.2011.5767911","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] D. Wen, L. Qin, Y. Zhang, X. Lin, and J.X. Yu, \u201cI\/o efficient core graph decomposition at web scale,\u201d 2016 IEEE 32nd International Conference on Data Engineering (ICDE), pp.133-144, 2016. 10.1109\/icde.2016.7498235","DOI":"10.1109\/ICDE.2016.7498235"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] R.-H. Li, Q. Song, X. Xiao, L. Qin, G. Wang, J.X. Yu, and R. Mao, \u201cI\/o-efficient algorithms for degeneracy computation on massive networks,\u201d IEEE Trans. Knowl. Data Eng., vol.34, no.7, pp.3335-3348, 2022. 10.1109\/tkde.2020.3021484","DOI":"10.1109\/TKDE.2020.3021484"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] M. Farach-Colton and M.T. Tsai, \u201cTight approximations of degeneracy in large graphs,\u201d LATIN 2016: Theoretical Informatics, ed. E. Kranakis, G. Navarro, and E. Ch\u00e1vez, Berlin, Heidelberg, pp.429-440, Springer Berlin Heidelberg, 2016. 10.1007\/978-3-662-49529-2_32","DOI":"10.1007\/978-3-662-49529-2_32"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] M. Elberfeld, A. Jakoby, and T. Tantau, \u201cLogspace versions of the theorems of bodlaender and courcelle,\u201d 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp.143-152, 2010. 10.1109\/focs.2010.21","DOI":"10.1109\/FOCS.2010.21"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E108.D\/3\/E108.D_2024FCP0005\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T03:33:18Z","timestamp":1740799998000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E108.D\/3\/E108.D_2024FCP0005\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,1]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2024fcp0005","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2025,3,1]]},"article-number":"2024FCP0005"}}