{"id":"https://openalex.org/W4220968281","doi":"https://doi.org/10.1587/transinf.2021fcp0005","title":"A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs","display_name":"A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs","publication_year":2022,"publication_date":"2022-02-28","ids":{"openalex":"https://openalex.org/W4220968281","doi":"https://doi.org/10.1587/transinf.2021fcp0005"},"language":"en","primary_location":{"id":"doi:10.1587/transinf.2021fcp0005","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2021fcp0005","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E105.D/3/E105.D_2021FCP0005/_pdf","source":{"id":"https://openalex.org/S2486202937","display_name":"IEICE Transactions on Information and Systems","issn_l":"0916-8532","issn":["0916-8532","1745-1361"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Information and Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.jstage.jst.go.jp/article/transinf/E105.D/3/E105.D_2021FCP0005/_pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067695781","display_name":"Taishu ITO","orcid":null},"institutions":[{"id":"https://openalex.org/I173009982","display_name":"Iwate University","ror":"https://ror.org/04cd75h10","country_code":"JP","type":"education","lineage":["https://openalex.org/I173009982"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Taishu ITO","raw_affiliation_strings":["Iwate University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Iwate University","institution_ids":["https://openalex.org/I173009982"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016179290","display_name":"Yusuke SANO","orcid":null},"institutions":[{"id":"https://openalex.org/I173009982","display_name":"Iwate University","ror":"https://ror.org/04cd75h10","country_code":"JP","type":"education","lineage":["https://openalex.org/I173009982"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yusuke SANO","raw_affiliation_strings":["Iwate University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Iwate University","institution_ids":["https://openalex.org/I173009982"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060815640","display_name":"Katsuhisa Yamanaka","orcid":"https://orcid.org/0000-0002-4333-8680"},"institutions":[{"id":"https://openalex.org/I173009982","display_name":"Iwate University","ror":"https://ror.org/04cd75h10","country_code":"JP","type":"education","lineage":["https://openalex.org/I173009982"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Katsuhisa YAMANAKA","raw_affiliation_strings":["Iwate University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Iwate University","institution_ids":["https://openalex.org/I173009982"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055615456","display_name":"Takashi HIRAYAMA","orcid":null},"institutions":[{"id":"https://openalex.org/I173009982","display_name":"Iwate University","ror":"https://ror.org/04cd75h10","country_code":"JP","type":"education","lineage":["https://openalex.org/I173009982"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takashi HIRAYAMA","raw_affiliation_strings":["Iwate University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Iwate University","institution_ids":["https://openalex.org/I173009982"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I173009982"],"apc_list":null,"apc_paid":null,"fwci":0.2874,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.55317241,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"E105.D","issue":"3","first_page":"466","last_page":"473"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.7009434103965759},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6906353235244751},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.631125271320343},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5696793794631958},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.528790295124054},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5135438442230225},{"id":"https://openalex.org/keywords/connected-component","display_name":"Connected component","score":0.4978923797607422},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48165881633758545},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47924306988716125},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.45433053374290466},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4502635598182678},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3731645941734314},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36881476640701294}],"concepts":[{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.7009434103965759},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6906353235244751},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.631125271320343},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5696793794631958},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.528790295124054},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5135438442230225},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.4978923797607422},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48165881633758545},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47924306988716125},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.45433053374290466},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4502635598182678},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3731645941734314},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36881476640701294},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1587/transinf.2021fcp0005","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2021fcp0005","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E105.D/3/E105.D_2021FCP0005/_pdf","source":{"id":"https://openalex.org/S2486202937","display_name":"IEICE Transactions on Information and Systems","issn_l":"0916-8532","issn":["0916-8532","1745-1361"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Information and Systems","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1587/transinf.2021fcp0005","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2021fcp0005","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E105.D/3/E105.D_2021FCP0005/_pdf","source":{"id":"https://openalex.org/S2486202937","display_name":"IEICE Transactions on Information and Systems","issn_l":"0916-8532","issn":["0916-8532","1745-1361"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Information and Systems","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5099999904632568,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G2228979554","display_name":null,"funder_award_id":"JP19K11812","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G2634556267","display_name":"Computational complexity on enumeration problems on big data analysis and applications of high-speed enumeration algorithms","funder_award_id":"19K11812","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G8458087533","display_name":null,"funder_award_id":"JP18H04091","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4220968281.pdf","grobid_xml":"https://content.openalex.org/works/W4220968281.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W99871796","https://openalex.org/W1522289436","https://openalex.org/W1555889346","https://openalex.org/W1868111879","https://openalex.org/W1932436296","https://openalex.org/W1986723262","https://openalex.org/W1988738304","https://openalex.org/W2006912660","https://openalex.org/W2007940874","https://openalex.org/W2009723146","https://openalex.org/W2030996579","https://openalex.org/W2098664737","https://openalex.org/W2115074797","https://openalex.org/W2122131629","https://openalex.org/W2398397658","https://openalex.org/W2404007012","https://openalex.org/W2728920311","https://openalex.org/W2735347466","https://openalex.org/W2767970464","https://openalex.org/W2951327881","https://openalex.org/W2971099286","https://openalex.org/W3014261031","https://openalex.org/W3088682254","https://openalex.org/W4250400200"],"related_works":["https://openalex.org/W2776184136","https://openalex.org/W3092119098","https://openalex.org/W3117270560","https://openalex.org/W2049969628","https://openalex.org/W2567532546","https://openalex.org/W2915580243","https://openalex.org/W4248853006","https://openalex.org/W2683784293","https://openalex.org/W2097210284","https://openalex.org/W3088682254"],"abstract_inverted_index":{"The":[0,42],"problem":[1,58,90,120],"of":[2,7,46,81,91,121,126,139,166,171],"enumerating":[3,122],"connected":[4,20,39,69],"induced":[5,21,40,124,137,156,169,187],"subgraphs":[6,22,107,125,138,157,170],"a":[8,127,181],"given":[9,128],"graph":[10,82,142],"is":[11,17,50,86,102,163],"classical":[12],"and":[13,60,147],"studied":[14],"well.":[15],"It":[16],"known":[18],"that":[19,134],"can":[23],"be":[24],"enumerated":[25],"in":[26,95,158],"constant":[27],"time":[28],"for":[29,185],"each":[30],"subgraph.":[31],"In":[32,72,98,114],"this":[33,73,115],"paper,":[34,74,116],"we":[35,75,117,179],"focus":[36,76],"on":[37,48,77],"highly":[38,105],"subgraphs.":[41,71,188],"most":[43],"major":[44,79],"concept":[45,80],"connectivity":[47],"graphs":[49],"vertex":[51,54],"connectivity.":[52],"For":[53],"connectivity,":[55,83],"some":[56],"enumeration":[57,61,183],"settings":[59],"algorithms":[62],"have":[63,180],"been":[64],"proposed,":[65],"such":[66],"as":[67],"k-vertex":[68],"spanning":[70],"another":[78],"edge-connectivity.":[84],"This":[85],"motivated":[87],"by":[88,174],"the":[89,119,154,164,167,177],"finding":[92],"evacuation":[93,99],"routes":[94,110],"road":[96],"networks.":[97],"routes,":[100],"edge-connectivity":[101],"important,":[103],"since":[104],"edge-connected":[106],"ensure":[108],"multiple":[109],"between":[111],"two":[112],"vertices.":[113],"consider":[118],"2-edge-connected":[123,136,155,168,186],"graph.":[129],"We":[130],"present":[131],"an":[132,140],"algorithm":[133,151,184],"enumerates":[135,152],"input":[141],"G":[143],"with":[144],"n":[145],"vertices":[146],"m":[148],"edges.":[149],"Our":[150],"all":[153],"O(n3m|SG|)":[159],"time,":[160],"where":[161],"SG":[162],"set":[165],"G.":[172],"Moreover,":[173],"slightly":[175],"modifying":[176],"algorithm,":[178],"O(n3m)-delay":[182]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}