{"id":"https://openalex.org/W2594655970","doi":"https://doi.org/10.1587/transinf.2016fcp0010","title":"A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set <i>V<sub>NT</sub></i> on Outerplanar Graphs","display_name":"A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set <i>V<sub>NT</sub></i> on Outerplanar Graphs","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2594655970","doi":"https://doi.org/10.1587/transinf.2016fcp0010","mag":"2594655970"},"language":"en","primary_location":{"id":"doi:10.1587/transinf.2016fcp0010","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2016fcp0010","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E100.D/3/E100.D_2016FCP0010/_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/E100.D/3/E100.D_2016FCP0010/_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 Mathematical Sciences, Faculty of Integrated Arts and Sciences, Tokushima University"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Faculty of Integrated Arts and Sciences, 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.4542,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.63162859,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"E100.D","issue":"3","first_page":"434","last_page":"443"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.9990000128746033,"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.9976999759674072,"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/terminal","display_name":"Terminal (telecommunication)","score":0.7501540184020996},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6588332653045654},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6124386787414551},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5697644948959351},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5331973433494568},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5140115022659302},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.494156152009964},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48698529601097107},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4828629791736603},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.4714525640010834},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45317110419273376},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4324299097061157},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3599894642829895},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3404875695705414},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.2779366970062256},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.22035521268844604},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.18912622332572937},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.12157019972801208}],"concepts":[{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.7501540184020996},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6588332653045654},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6124386787414551},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5697644948959351},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5331973433494568},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5140115022659302},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.494156152009964},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48698529601097107},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4828629791736603},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.4714525640010834},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45317110419273376},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4324299097061157},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3599894642829895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3404875695705414},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2779366970062256},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.22035521268844604},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.18912622332572937},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.12157019972801208},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1587/transinf.2016fcp0010","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2016fcp0010","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E100.D/3/E100.D_2016FCP0010/_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.2016fcp0010","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2016fcp0010","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E100.D/3/E100.D_2016FCP0010/_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/W2594655970.pdf","grobid_xml":"https://content.openalex.org/works/W2594655970.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W1579049696","https://openalex.org/W1996291336","https://openalex.org/W1997290361","https://openalex.org/W2059109315","https://openalex.org/W2059355023","https://openalex.org/W2090857456","https://openalex.org/W2798588639"],"related_works":["https://openalex.org/W1754127855","https://openalex.org/W2074417667","https://openalex.org/W2002489000","https://openalex.org/W2004163233","https://openalex.org/W2002657351","https://openalex.org/W2931047390","https://openalex.org/W1980307941","https://openalex.org/W2059063102","https://openalex.org/W2888832884","https://openalex.org/W2594655970"],"abstract_inverted_index":{"Given":[0],"a":[1,17,23,31,39,61,66],"graph":[2,89],"G=(V,":[3],"E),":[4],"where":[5,57],"V":[6,52],"and":[7,11,16,41],"E":[8],"are":[9],"vertex":[10,59],"edge":[12],"sets":[13],"of":[14,20,45,51,73,77,94,104],"G,":[15],"subset":[18],"VNT":[19],"vertices":[21,50],"called":[22],"non-terminal":[24,32,62],"set,":[25],"the":[26,54,71,102],"minimum":[27,55],"spanning":[28,43],"tree":[29],"with":[30,53,99],"set":[33,63],"VNT,":[34],"denoted":[35],"by":[36],"MSTNT,":[37],"is":[38,64,79,86,96],"connected":[40],"acyclic":[42],"subgraph":[44],"G":[46,78,85,95],"that":[47,83],"contains":[48],"all":[49],"weight":[56],"each":[58],"in":[60],"not":[65],"leaf.":[67],"On":[68],"general":[69],"graphs,":[70],"problem":[72],"finding":[74,91],"an":[75,87,92],"MSTNT":[76,93],"NP-hard.":[80],"We":[81],"show":[82],"if":[84],"outerplanar":[88],"then":[90],"linearly":[97],"solvable":[98],"respect":[100],"to":[101],"number":[103],"vertices.":[105]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}