{"id":"https://openalex.org/W2525692986","doi":"https://doi.org/10.1587/transinf.2016edp7021","title":"A Linear Time Algorithm for Finding a Spanning Tree with Non-Terminal Set <i>V<sub>NT</sub></i> on Cographs","display_name":"A Linear Time Algorithm for Finding a Spanning Tree with Non-Terminal Set <i>V<sub>NT</sub></i> on Cographs","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2525692986","doi":"https://doi.org/10.1587/transinf.2016edp7021","mag":"2525692986"},"language":"en","primary_location":{"id":"doi:10.1587/transinf.2016edp7021","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2016edp7021","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E99.D/10/E99.D_2016EDP7021/_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/E99.D/10/E99.D_2016EDP7021/_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.7188,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.76072036,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"E99.D","issue":"10","first_page":"2574","last_page":"2584"},"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.9976000189781189,"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.9975000023841858,"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.8121746778488159},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7709165811538696},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.7550125122070312},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6680639982223511},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5835250616073608},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5582404136657715},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.5518624186515808},{"id":"https://openalex.org/keywords/terminal","display_name":"Terminal (telecommunication)","score":0.5177168250083923},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.46886545419692993},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4394245445728302},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4367102384567261},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.412866473197937},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39855504035949707},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2582757771015167},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0522879958152771}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8121746778488159},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7709165811538696},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.7550125122070312},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6680639982223511},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5835250616073608},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5582404136657715},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.5518624186515808},{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.5177168250083923},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.46886545419692993},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4394245445728302},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4367102384567261},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.412866473197937},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39855504035949707},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2582757771015167},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0522879958152771},{"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.2016edp7021","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2016edp7021","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E99.D/10/E99.D_2016EDP7021/_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.2016edp7021","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2016edp7021","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E99.D/10/E99.D_2016EDP7021/_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":[{"id":"https://openalex.org/G3236194794","display_name":null,"funder_award_id":"Grant-in-Aid","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G3459562248","display_name":null,"funder_award_id":"Grant","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G4582991212","display_name":"Technological integration measure estimation method integtating  spatial statistics and patent information analysis and regional innovation policy evaluation method","funder_award_id":"26330359","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G4874944895","display_name":null,"funder_award_id":"-in-Aid","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G7752643416","display_name":null,"funder_award_id":"Japan","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G984590288","display_name":"\u6728\u6750\u306epH\u306b\u95a2\u3059\u308b\u7814\u7a76","funder_award_id":"63303","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":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2525692986.pdf","grobid_xml":"https://content.openalex.org/works/W2525692986.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W2006278018","https://openalex.org/W2015906942","https://openalex.org/W2028775537","https://openalex.org/W2055745794","https://openalex.org/W2090857456","https://openalex.org/W2143327390","https://openalex.org/W2171760878"],"related_works":["https://openalex.org/W2165776452","https://openalex.org/W3099328339","https://openalex.org/W2963355678","https://openalex.org/W2069230977","https://openalex.org/W2684541573","https://openalex.org/W1545167657","https://openalex.org/W2803918337","https://openalex.org/W3211968237","https://openalex.org/W1992843866","https://openalex.org/W2577535483"],"abstract_inverted_index":{"Given":[0],"a":[1,9,18,24,35,54,59,71,78,83,99,148,152,156],"graph":[2],"G=(V,E)":[3],"where":[4,50,64,105],"V":[5,49],"and":[6,11,37,122],"E":[7],"are":[8],"vertex":[10,52],"an":[12],"edge":[13,66,107,132,167],"set,":[14,26],"respectively,":[15],"specified":[16],"with":[17,30,82,155],"subset":[19],"VNT":[20,33,86,159],"of":[21,41,48,70,76,87,97,111,136,160,171],"vertices":[22,47],"called":[23],"non-terminal":[25,31,55,84,157],"the":[27,46,62,68,74,95,109,134,169],"spanning":[28,39,80,100,153],"tree":[29,81,101,154],"set":[32,56,85,158],"is":[34,57,127,147,162],"connected":[36],"acyclic":[38],"subgraph":[40],"G":[42,88,146,161],"that":[43,125,144],"contains":[44],"all":[45],"each":[51,65,106,131,166],"in":[53],"not":[58],"leaf.":[60],"In":[61,115],"case":[63],"has":[67,108,133,168],"weight":[69,110,135,170],"nonnegative":[72],"integer,":[73],"problem":[75,121],"finding":[77,98,151],"minimum":[79],"was":[89,113],"known":[90],"to":[91],"be":[92],"NP-hard.":[93],"However,":[94],"complexity":[96],"on":[102,138],"general":[103,139],"graphs":[104],"one":[112,137],"unknown.":[114],"this":[116,120],"paper,":[117],"we":[118],"consider":[119],"first":[123],"show":[124,143],"it":[126],"NP-hard":[128],"even":[129],"if":[130,145],"graphs.":[140],"We":[141],"also":[142],"cograph":[149],"then":[150],"linearly":[163],"solvable":[164],"when":[165],"one.":[172]},"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":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}