{"id":"https://openalex.org/W4289076335","doi":"https://doi.org/10.1587/transinf.2021edp7175","title":"A Polynomial-Time Algorithm for Finding a Spanning Tree with Non-Terminal Set <i>V<sub>NT</sub></i> on Circular-Arc Graphs","display_name":"A Polynomial-Time Algorithm for Finding a Spanning Tree with Non-Terminal Set <i>V<sub>NT</sub></i> on Circular-Arc Graphs","publication_year":2022,"publication_date":"2022-07-31","ids":{"openalex":"https://openalex.org/W4289076335","doi":"https://doi.org/10.1587/transinf.2021edp7175"},"language":"en","primary_location":{"id":"doi:10.1587/transinf.2021edp7175","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2021edp7175","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E105.D/8/E105.D_2021EDP7175/_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/8/E105.D_2021EDP7175/_pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112665363","display_name":"Shinichi Nakayama","orcid":null},"institutions":[{"id":"https://openalex.org/I922474255","display_name":"Tokushima University","ror":"https://ror.org/044vy1d05","country_code":"JP","type":"education","lineage":["https://openalex.org/I922474255"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Shin-ichi NAKAYAMA","raw_affiliation_strings":["Department of Science and Technology, Tokushima University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Science and Technology, Tokushima University","institution_ids":["https://openalex.org/I922474255"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070060839","display_name":"Shigeru Masuyama","orcid":null},"institutions":[{"id":"https://openalex.org/I161296585","display_name":"Tokyo University of Science","ror":"https://ror.org/05sj3n476","country_code":"JP","type":"education","lineage":["https://openalex.org/I161296585"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Shigeru MASUYAMA","raw_affiliation_strings":["Department of Management, School of Management, Tokyo University of Science"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Management, School of Management, Tokyo University of Science","institution_ids":["https://openalex.org/I161296585"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11845851,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"E105.D","issue":"8","first_page":"1373","last_page":"1382"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9927999973297119,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8454149961471558},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7163534760475159},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6164998412132263},{"id":"https://openalex.org/keywords/terminal","display_name":"Terminal (telecommunication)","score":0.5096678733825684},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5062726736068726},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4901445806026459},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.4810517132282257},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4371117055416107},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43694815039634705},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4363396167755127},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.4311111867427826},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.41217660903930664},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2958237826824188}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8454149961471558},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7163534760475159},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6164998412132263},{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.5096678733825684},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5062726736068726},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4901445806026459},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.4810517132282257},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4371117055416107},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43694815039634705},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4363396167755127},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.4311111867427826},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.41217660903930664},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2958237826824188},{"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.2021edp7175","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2021edp7175","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E105.D/8/E105.D_2021EDP7175/_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.2021edp7175","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2021edp7175","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E105.D/8/E105.D_2021EDP7175/_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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4289076335.pdf","grobid_xml":"https://content.openalex.org/works/W4289076335.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W1974513303","https://openalex.org/W2024491681","https://openalex.org/W2048237851","https://openalex.org/W2049520215","https://openalex.org/W2053623386","https://openalex.org/W2057556050","https://openalex.org/W2074937107","https://openalex.org/W2090857456","https://openalex.org/W2160875590","https://openalex.org/W2525692986","https://openalex.org/W2594655970","https://openalex.org/W2888832884","https://openalex.org/W2931047390","https://openalex.org/W3022173737"],"related_works":["https://openalex.org/W1143194816","https://openalex.org/W2307044859","https://openalex.org/W4380840098","https://openalex.org/W1569529368","https://openalex.org/W2099915933","https://openalex.org/W2350799039","https://openalex.org/W2014991506","https://openalex.org/W2047517090","https://openalex.org/W2943635264","https://openalex.org/W2048177396"],"abstract_inverted_index":{"Given":[0],"a":[1,17,23,26,30,38,56,61,88],"graph":[2,90],"G=(V,":[3],"E),":[4],"where":[5,52],"V":[6,51],"and":[7,11,16,40],"E":[8],"are":[9],"vertex":[10,54],"edge":[12],"sets":[13],"of":[14,20,44,50,68,72,95,105],"G,":[15],"subset":[18],"VNT":[19],"vertices":[21,49],"called":[22],"non-terminal":[24,31,57],"set,":[25],"spanning":[27,42],"tree":[28],"with":[29,100],"set":[32,58],"VNT,":[33],"denoted":[34],"by":[35],"STNT,":[36],"is":[37,59,74,87,97],"connected":[39],"acyclic":[41],"subgraph":[43],"G":[45,73,86,96],"that":[46,84],"contains":[47],"all":[48],"each":[53],"in":[55],"not":[60],"leaf.":[62],"On":[63],"general":[64],"graphs,":[65],"the":[66,103],"problem":[67],"finding":[69,92],"an":[70,93],"STNT":[71,94],"known":[75],"to":[76,102],"be":[77],"NP-hard.":[78],"In":[79],"this":[80],"paper,":[81],"we":[82],"show":[83],"if":[85],"circular-arc":[89],"then":[91],"polynomially":[98],"solvable":[99],"respect":[101],"number":[104],"vertices.":[106]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}