{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T11:44:09Z","timestamp":1782906249055,"version":"3.54.5"},"reference-count":25,"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":[[2022,3,1]]},"DOI":"10.1587\/transinf.2021fcp0005","type":"journal-article","created":{"date-parts":[[2022,2,28]],"date-time":"2022-02-28T22:25:47Z","timestamp":1646087147000},"page":"466-473","source":"Crossref","is-referenced-by-count":3,"title":["A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs"],"prefix":"10.1587","volume":"E105.D","author":[{"given":"Taishu","family":"ITO","sequence":"first","affiliation":[{"name":"Iwate University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yusuke","family":"SANO","sequence":"additional","affiliation":[{"name":"Iwate University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Katsuhisa","family":"YAMANAKA","sequence":"additional","affiliation":[{"name":"Iwate University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Takashi","family":"HIRAYAMA","sequence":"additional","affiliation":[{"name":"Iwate University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] Y. Sano, K. Yamanaka, and T. Hirayama, \u201cA polynomial delay algorithm for enumerating 2-edge-connected induced subgraphs,\u201d Frontiers in Algorithmics-14th International Workshop, FAW 2020, Haikou, China, Oct. 19-21, 2020, Proceedings, ed. M. Li, Lecture Notes in Computer Science, vol.12340, pp.13-24, Springer, 2020. 10.1007\/978-3-030-59901-0_2","DOI":"10.1007\/978-3-030-59901-0_2"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] E. Birmel\u00e9, R. Ferreira, R. Grossi, A. Marino, N. Pisanti, R. Rizzi, and G. Sacomoto, \u201cOptimal Listing of Cycles and st-Paths in Undirected Graphs,\u201d Proc. 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), pp.1884-1896, Jan. 2012. 10.1137\/1.9781611973105.134","DOI":"10.1137\/1.9781611973105.134"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] R. Ferreira, R. Grossi, R. Rizzi, G. Sacomoto, and M.F. Sagot, \u201cAmortized ~O(|<i>V<\/i>|)-delay algorithm for listing chordless cycles in undirected graphs,\u201d Proc. 22nd European Symposium on Algorithms (ESA 2014), Lecture Notes in Computer Science, vol.8737, pp.418-429, 2014. 10.1007\/978-3-662-44777-2_35","DOI":"10.1007\/978-3-662-44777-2_35"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] R.C. Read and R.E. Tarjan, \u201cBounds on backtrack algorithms for listing cycles, paths, and spanning trees,\u201d Networks, vol.5, no.3, pp.237-252, 1975. 10.1002\/net.1975.5.3.237","DOI":"10.1002\/net.1975.5.3.237"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] T. Uno and H. Satoh, \u201cAn efficient algorithm for enumerating chordless cycles and chordless paths,\u201d Proc. 17th International Conference on Discovery Science (DS 2014), vol.8777, pp.313-324, 2014. 10.1007\/978-3-319-11812-3_27","DOI":"10.1007\/978-3-319-11812-3_27"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] K. Wasa, Y. Kaneta, T. Uno, and H. Arimura, \u201cConstant time enumeration of subtrees with exactly <i>k<\/i> nodes in a tree,\u201d IEICE Trans. Inf. &amp; Syst., vol.97-D, no.3, pp.421-430, 2014. 10.1587\/transinf.e97.d.421","DOI":"10.1587\/transinf.E97.D.421"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] A. Shioura, A. Tamura, and T. Uno, \u201cAn optimal algorithm for scanning all spanning trees of undirected graphs,\u201d SIAM Journal of Computing, vol.26, no.3, pp.678-692, 1997. 10.1137\/s0097539794270881","DOI":"10.1137\/S0097539794270881"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] T. Uno, \u201cConstant time enumeration by amortization,\u201d Proc. 14th International Symposium on Algorithms and Data Structures (WADS 2015), vol.9214, pp.593-605, 2015. 10.1007\/978-3-319-21840-3_49","DOI":"10.1007\/978-3-319-21840-3_49"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[10] L. Khachiyan, E. Boros, K. Borys, K.M. Elbassioni, V. Gurvich, and K. Makino, \u201cEnumerating spanning and connected subsets in graphs and matroids,\u201d Proc. 14th Annual European Symposium on Algorithms (ESA 2006), vol.4168, pp.444-455, 2006. 10.1007\/11841036_41","DOI":"10.1007\/11841036_41"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[11] K. Yamanaka, Y. Matsui, and S. Nakano, \u201cEnumerating highly-edge-connected spanning subgraphs,\u201d IEICE Trans. Fundamentals, vol.102-A, no.9, pp.1002-1006, 2019. 10.1587\/transfun.e102.a.1002","DOI":"10.1587\/transfun.E102.A.1002"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[12] T. Akiba, Y. Iwata, and Y. Yoshida, \u201cLinear-time enumeration of maximal <i>k<\/i>-edge-connected subgraphs in large networks by random contraction,\u201d Proc. 22nd ACM International Conference on Information and Knowledge Management (CIKM 2013), pp.909-918, 2013. 10.1145\/2505515.2505751","DOI":"10.1145\/2505515.2505751"},{"key":"12","unstructured":"[13] A. Conte, R.D. Virgilio, A. Maccioni, M. Patrignani, and R. Torlone, \u201cFinding all maximal cliques in very large social networks,\u201d Proc. 19th International Conference on Extending Database Technology, pp.173-184, 2016."},{"key":"13","doi-asserted-by":"crossref","unstructured":"[14] K. Makino and T. Uno, \u201cNew algorithms for enumerating all maximal cliques,\u201d Proc. 9th Scandinavian Workshop on Algorithm Theory (SWAT 2004), vol.3111, pp.260-272, 2004. 10.1007\/978-3-540-27810-8_23","DOI":"10.1007\/978-3-540-27810-8_23"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[15] T. Uno, \u201cAn efficient algorithm for solving pseudo clique enumeration problem,\u201d Algorithmica, vol.56, no.1, pp.3-16, 2010. 10.1007\/s00453-008-9238-3","DOI":"10.1007\/s00453-008-9238-3"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[16] A. Conte, M.M. Kant\u00e9, Y. Otachi, T. Uno, and K. Wasa, \u201cEfficient enumeration of maximal <i>k<\/i>-degenerate subgraphs in a chordal graph,\u201d Proc. 23rd Annual International Computing and Combinatorics Conference (COCOON 2017), vol.10392, pp.150-161, 2017. 10.1007\/978-3-319-62389-4_13","DOI":"10.1007\/978-3-319-62389-4_13"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[17] K. Kurita, K. Wasa, T. Uno, and H. Arimura, \u201cEfficient enumeration of induced matchings in a graph without cycles with length four,\u201d IEICE Trans. Fundamentals, vol.101-A, no.9, pp.1383-1391, 2018. 10.1587\/transfun.e101.a.1383","DOI":"10.1587\/transfun.E101.A.1383"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[18] D. Avis and K. Fukuda, \u201cReverse search for enumeration,\u201d Discrete Applied Mathematics, vol.65, no.1-3, pp.21-46, 1996. 10.1016\/0166-218x(95)00026-n","DOI":"10.1016\/0166-218X(95)00026-N"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[19] S. Maxwell, M.R. Chance, and M. Koyut\u00fcrk, \u201cEfficiently enumerating all connected induced subgraphs of a large molecular network,\u201d Prceedings of The First International Conference on Algorithms for Computational Biology, vol.8542, pp.171-182, 2014. 10.1007\/978-3-319-07953-0_14","DOI":"10.1007\/978-3-319-07953-0_14"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[20] A. Marino, Analysis and Enumeration, Atlantis press, 2015. 10.2991\/978-94-6239-097-3_2","DOI":"10.2991\/978-94-6239-097-3"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[21] A. Conte and T. Uno, \u201cNew polynomial delay bounds for maximal subgraph enumeration by proximity search,\u201d Proc. 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC 2019), pp.1179-1190, 2019. 10.1145\/3313276.3316402","DOI":"10.1145\/3313276.3316402"},{"key":"21","unstructured":"[22] K. Haraguchi and H. Nagamochi, \u201cDesign of polynomial-delay enumeration algorithms in transitive systems,\u201d CoRR, vol.abs\/2004.01904, 2020."},{"key":"22","doi-asserted-by":"publisher","unstructured":"[23] S. Nakano and T. Uno, \u201cGenerating colored trees,\u201d Proc. 31th Workshop on Graph-Theoretic Concepts in Computer Science, (WG 2005), vol.LNCS 3787, pp.249-260, 2005. 10.1007\/11604686_22","DOI":"10.1007\/11604686_22"},{"key":"23","unstructured":"[24] D.B. West, Introduction to Graph Theory, 2 ed., Prentice Hall, Sept. 2000."},{"key":"24","doi-asserted-by":"publisher","unstructured":"[25] L.G. Valiant, \u201cThe complexity of computing the permanent,\u201d Theoretical Computer Science, vol.8, no.2, pp.189-201, 1979. 10.1016\/0304-3975(79)90044-6","DOI":"10.1016\/0304-3975(79)90044-6"},{"key":"25","doi-asserted-by":"publisher","unstructured":"[26] D.S. Johnson, C.H. Papadimitriou, and M. Yannakakis, \u201cOn generating all maximal independent sets,\u201d Information Processing Letters, vol.27, no.3, pp.119-123, 1988. 10.1016\/0020-0190(88)90065-8","DOI":"10.1016\/0020-0190(88)90065-8"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E105.D\/3\/E105.D_2021FCP0005\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T04:01:53Z","timestamp":1646452913000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E105.D\/3\/E105.D_2021FCP0005\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,1]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2021fcp0005","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,1]]},"article-number":"2021FCP0005"}}