{"id":"https://openalex.org/W2888832884","doi":"https://doi.org/10.1587/transinf.2018edp7047","title":"A Linear-Time Algorithm for Finding a Spanning Tree with Non-Terminal Set <i>V<sub>NT</sub></i> on Interval Graphs","display_name":"A Linear-Time Algorithm for Finding a Spanning Tree with Non-Terminal Set <i>V<sub>NT</sub></i> on Interval Graphs","publication_year":2018,"publication_date":"2018-08-31","ids":{"openalex":"https://openalex.org/W2888832884","doi":"https://doi.org/10.1587/transinf.2018edp7047","mag":"2888832884"},"language":"en","primary_location":{"id":"doi:10.1587/transinf.2018edp7047","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2018edp7047","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E101.D/9/E101.D_2018EDP7047/_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/E101.D/9/E101.D_2018EDP7047/_pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113587545","display_name":"Shin-ichi 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":true,"raw_author_name":"Shin-ichi NAKAYAMA","raw_affiliation_strings":["Department of Science and Technology, Tokushima University"],"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/I136259955","display_name":"Toyohashi University of Technology","ror":"https://ror.org/04ezg6d83","country_code":"JP","type":"education","lineage":["https://openalex.org/I136259955"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Shigeru MASUYAMA","raw_affiliation_strings":["Department of Computer Science and Engineering, Toyohashi University of Technology"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Toyohashi University of Technology","institution_ids":["https://openalex.org/I136259955"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113587545"],"corresponding_institution_ids":["https://openalex.org/I922474255"],"apc_list":null,"apc_paid":null,"fwci":0.2019,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.54070184,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"E101.D","issue":"9","first_page":"2235","last_page":"2246"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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.998199999332428,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980999827384949,"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/spanning-tree","display_name":"Spanning tree","score":0.8000006079673767},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7705059051513672},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6386251449584961},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.635280966758728},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.616635799407959},{"id":"https://openalex.org/keywords/terminal","display_name":"Terminal (telecommunication)","score":0.608254611492157},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5698736906051636},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5008237361907959},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4440646469593048},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4388326406478882},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4281000792980194},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.4194043278694153},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.411947637796402},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34743374586105347},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.04521632194519043}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8000006079673767},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7705059051513672},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6386251449584961},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.635280966758728},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.616635799407959},{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.608254611492157},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5698736906051636},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5008237361907959},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4440646469593048},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4388326406478882},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4281000792980194},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.4194043278694153},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.411947637796402},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34743374586105347},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.04521632194519043}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1587/transinf.2018edp7047","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2018edp7047","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E101.D/9/E101.D_2018EDP7047/_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.2018edp7047","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2018edp7047","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E101.D/9/E101.D_2018EDP7047/_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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2888832884.pdf","grobid_xml":"https://content.openalex.org/works/W2888832884.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W2024491681","https://openalex.org/W2053623386","https://openalex.org/W2057556050","https://openalex.org/W2090857456","https://openalex.org/W2143474538","https://openalex.org/W2525692986","https://openalex.org/W2594655970","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,9,18,24,35,54,59,65,102,106],"graph":[2,99],"G=(V,E)":[3],"where":[4,50,75],"V":[5,49],"and":[6,11,37],"E":[7],"are":[8],"vertex":[10,52],"an":[12,97],"edge":[13,77,116],"set,":[14,26],"respectively,":[15],"specified":[16],"with":[17,30,68,105],"subset":[19],"VNT":[20,33,71,109],"of":[21,41,48,63,81,110,120],"vertices":[22,47],"called":[23],"non-terminal":[25,31,55,69,107],"the":[27,46,79,118],"spanning":[28,39,66,103],"tree":[29,67,104],"set":[32,56,70,108],"is":[34,57,83,96,112],"connected":[36],"acyclic":[38],"subgraph":[40],"G":[42,95,111],"that":[43,93],"contains":[44],"all":[45],"each":[51,76,115],"in":[53],"not":[58],"leaf.":[60],"The":[61],"complexity":[62],"finding":[64,101],"on":[72],"general":[73],"graphs":[74],"has":[78,117],"weight":[80,119],"one":[82],"known":[84],"to":[85],"be":[86],"NP-hard.":[87],"In":[88],"this":[89],"paper,":[90],"we":[91],"show":[92],"if":[94],"interval":[98],"then":[100],"linearly-solvable":[113],"when":[114],"one.":[121]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}