{"id":"https://openalex.org/W2545708558","doi":"https://doi.org/10.1007/978-3-319-48749-6_6","title":"Computing a Tree Having a Small Vertex Cover","display_name":"Computing a Tree Having a Small Vertex Cover","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2545708558","doi":"https://doi.org/10.1007/978-3-319-48749-6_6","mag":"2545708558"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-48749-6_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-48749-6_6","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054214899","display_name":"Takuro Fukunaga","orcid":"https://orcid.org/0000-0003-3285-2876"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Takuro Fukunaga","raw_affiliation_strings":["JST, ERATO, Kawarabayashi Large Graph Project, Tokyo, Japan","National Institute of Informatics, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"JST, ERATO, Kawarabayashi Large Graph Project, Tokyo, Japan","institution_ids":[]},{"raw_affiliation_string":"National Institute of Informatics, Tokyo, Japan","institution_ids":["https://openalex.org/I184597095"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009867352","display_name":"Takanori Maehara","orcid":"https://orcid.org/0000-0002-2101-1484"},"institutions":[{"id":"https://openalex.org/I1298590031","display_name":"Shizuoka University","ror":"https://ror.org/01w6wtk13","country_code":"JP","type":"education","lineage":["https://openalex.org/I1298590031"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takanori Maehara","raw_affiliation_strings":["Department of Mathematical and Systems Engineering, Shizuoka University, Shizuoka, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical and Systems Engineering, Shizuoka University, Shizuoka, Japan","institution_ids":["https://openalex.org/I1298590031"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5054214899"],"corresponding_institution_ids":["https://openalex.org/I184597095"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.23227848,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"77","last_page":"91"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10374","display_name":"Advanced Graph Theory Research","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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8716597557067871},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7435206174850464},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7313035726547241},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6542488932609558},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.6479422450065613},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6437457799911499},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.634954571723938},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.5133320689201355},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45288562774658203},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44708824157714844},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44216200709342957},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.385986328125},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35717636346817017},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.25180935859680176},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.11092859506607056}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8716597557067871},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7435206174850464},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7313035726547241},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6542488932609558},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.6479422450065613},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6437457799911499},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.634954571723938},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5133320689201355},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45288562774658203},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44708824157714844},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44216200709342957},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.385986328125},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35717636346817017},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.25180935859680176},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.11092859506607056}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-48749-6_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-48749-6_6","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W96441109","https://openalex.org/W328736688","https://openalex.org/W1497398712","https://openalex.org/W1607840687","https://openalex.org/W1973566854","https://openalex.org/W1976584101","https://openalex.org/W2001352447","https://openalex.org/W2022082910","https://openalex.org/W2047993669","https://openalex.org/W2060329104","https://openalex.org/W2089847997","https://openalex.org/W2122195804","https://openalex.org/W2135920560","https://openalex.org/W2147879413","https://openalex.org/W2151438396","https://openalex.org/W2155234080","https://openalex.org/W2169848785","https://openalex.org/W2407680873","https://openalex.org/W2952281621","https://openalex.org/W3141863997","https://openalex.org/W3205695408","https://openalex.org/W4250792653"],"related_works":["https://openalex.org/W2183636263","https://openalex.org/W1595291551","https://openalex.org/W974563791","https://openalex.org/W2739242419","https://openalex.org/W2999680961","https://openalex.org/W1585318792","https://openalex.org/W1524393328","https://openalex.org/W2949165555","https://openalex.org/W2096702260","https://openalex.org/W4244816249"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}