{"id":"https://openalex.org/W2931047390","doi":"https://doi.org/10.1587/transinf.2018edp7232","title":"A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set <i>V<sub>NT</sub></i> on Series-Parallel Graphs","display_name":"A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set <i>V<sub>NT</sub></i> on Series-Parallel Graphs","publication_year":2019,"publication_date":"2019-03-31","ids":{"openalex":"https://openalex.org/W2931047390","doi":"https://doi.org/10.1587/transinf.2018edp7232","mag":"2931047390"},"language":"en","primary_location":{"id":"doi:10.1587/transinf.2018edp7232","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2018edp7232","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E102.D/4/E102.D_2018EDP7232/_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/E102.D/4/E102.D_2018EDP7232/_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/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"],"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":["https://openalex.org/A5113587545"],"corresponding_institution_ids":["https://openalex.org/I922474255"],"apc_list":null,"apc_paid":null,"fwci":0.194,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.50219349,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"E102.D","issue":"4","first_page":"826","last_page":"835"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9995999932289124,"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.9983000159263611,"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/computer-science","display_name":"Computer science","score":0.8006536364555359},{"id":"https://openalex.org/keywords/terminal","display_name":"Terminal (telecommunication)","score":0.6920494437217712},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6005471348762512},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5886321067810059},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.549456000328064},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5299433469772339},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5017414093017578},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48739367723464966},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.42668992280960083},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41491737961769104},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4148351848125458},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3047787547111511},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.28102627396583557},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.225816011428833},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.20264559984207153},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18054011464118958},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.12562748789787292},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06799590587615967}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8006536364555359},{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.6920494437217712},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6005471348762512},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5886321067810059},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.549456000328064},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5299433469772339},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5017414093017578},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48739367723464966},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.42668992280960083},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41491737961769104},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4148351848125458},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3047787547111511},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28102627396583557},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.225816011428833},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.20264559984207153},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18054011464118958},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.12562748789787292},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06799590587615967},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1587/transinf.2018edp7232","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2018edp7232","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E102.D/4/E102.D_2018EDP7232/_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.2018edp7232","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2018edp7232","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E102.D/4/E102.D_2018EDP7232/_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/W2931047390.pdf","grobid_xml":"https://content.openalex.org/works/W2931047390.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W2018876684","https://openalex.org/W2038443890","https://openalex.org/W2059109315","https://openalex.org/W2064796716","https://openalex.org/W2090857456","https://openalex.org/W2525692986","https://openalex.org/W2594655970","https://openalex.org/W2888832884"],"related_works":["https://openalex.org/W2888832884","https://openalex.org/W3191415409","https://openalex.org/W3119322905","https://openalex.org/W2594655970","https://openalex.org/W2525692986","https://openalex.org/W2796034895","https://openalex.org/W2564730345","https://openalex.org/W2561446030","https://openalex.org/W2034024086","https://openalex.org/W2624437099","https://openalex.org/W2585216925","https://openalex.org/W2082095538","https://openalex.org/W2020604073","https://openalex.org/W2589500452","https://openalex.org/W1599894364","https://openalex.org/W1541890612","https://openalex.org/W1973942323","https://openalex.org/W2201964723","https://openalex.org/W2364797726","https://openalex.org/W34797136"],"abstract_inverted_index":{"Given":[0],"a":[1,16,22,30,38,60,65,86],"graph":[2,88],"G=(V,E),":[3],"where":[4,56],"V":[5,51],"and":[6,10,15,40],"E":[7],"are":[8],"vertex":[9,58],"edge":[11],"sets":[12],"of":[13,19,44,50,72,76,93,103],"G,":[14],"subset":[17],"VNT":[18],"vertices":[20,49],"called":[21],"non-terminal":[23,31,61],"set,":[24],"the":[25,53,70,101],"minimum":[26,54],"spanning":[27,42],"tree":[28],"with":[29,52,98],"set":[32,62],"VNT,":[33],"denoted":[34],"by":[35],"MSTNT,":[36],"is":[37,63,78,85,95],"connected":[39],"acyclic":[41],"subgraph":[43],"G":[45,77,84,94],"that":[46,82],"contains":[47],"all":[48],"weight":[55],"each":[57],"in":[59],"not":[64],"leaf.":[66],"On":[67],"general":[68],"graphs,":[69],"problem":[71],"finding":[73,90],"an":[74,91],"MSTNT":[75,92],"NP-hard.":[79],"We":[80],"show":[81],"if":[83],"series-parallel":[87],"then":[89],"linearly":[96],"solvable":[97],"respect":[99],"to":[100],"number":[102],"vertices.":[104]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}