{"id":"https://openalex.org/W3135663958","doi":"https://doi.org/10.1007/978-3-030-68211-8_3","title":"Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees","display_name":"Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3135663958","doi":"https://doi.org/10.1007/978-3-030-68211-8_3","mag":"3135663958"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-68211-8_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-68211-8_3","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/A5100457211","display_name":"Haitao Wang","orcid":"https://orcid.org/0000-0001-9048-6494"},"institutions":[{"id":"https://openalex.org/I121980950","display_name":"Utah State University","ror":"https://ror.org/00h6set76","country_code":"US","type":"education","lineage":["https://openalex.org/I121980950"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Haitao Wang","raw_affiliation_strings":["Department of Computer Science, Utah State University, Logan, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Utah State University, Logan, USA","institution_ids":["https://openalex.org/I121980950"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056552746","display_name":"Yiming Zhao","orcid":"https://orcid.org/0000-0001-5080-5251"},"institutions":[{"id":"https://openalex.org/I121980950","display_name":"Utah State University","ror":"https://ror.org/00h6set76","country_code":"US","type":"education","lineage":["https://openalex.org/I121980950"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yiming Zhao","raw_affiliation_strings":["Department of Computer Science, Utah State University, Logan, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Utah State University, Logan, USA","institution_ids":["https://openalex.org/I121980950"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100457211"],"corresponding_institution_ids":["https://openalex.org/I121980950"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.0903,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.78126316,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"27","last_page":"39"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987999796867371,"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.9984999895095825,"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/subroutine","display_name":"Subroutine","score":0.7314807772636414},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6631861925125122},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.6369041800498962},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5283653736114502},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.5191830396652222},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4726411700248718},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4591611623764038},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.45145002007484436},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40721115469932556},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3689764142036438},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35424959659576416}],"concepts":[{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.7314807772636414},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6631861925125122},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6369041800498962},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5283653736114502},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.5191830396652222},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4726411700248718},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4591611623764038},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.45145002007484436},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40721115469932556},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3689764142036438},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35424959659576416},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-030-68211-8_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-68211-8_3","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"},{"id":"pmh:oai:digitalcommons.usu.edu:computer_science_facpubs-1022","is_oa":false,"landing_page_url":"https://digitalcommons.usu.edu/computer_science_facpubs/22","pdf_url":null,"source":{"id":"https://openalex.org/S4377196327","display_name":"Digital Commons - USU (Utah State University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I121980950","host_organization_name":"Utah State University","host_organization_lineage":["https://openalex.org/I121980950"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Faculty and Staff Publications","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W2000303018","https://openalex.org/W2102564932","https://openalex.org/W2120424341","https://openalex.org/W2139594840","https://openalex.org/W2195699850","https://openalex.org/W2293957677","https://openalex.org/W2480249651","https://openalex.org/W2572905496","https://openalex.org/W2898839814","https://openalex.org/W2951212506","https://openalex.org/W2963294239","https://openalex.org/W2966835187","https://openalex.org/W3023988220","https://openalex.org/W3038118680","https://openalex.org/W3135663958"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W2089134982","https://openalex.org/W4299305030","https://openalex.org/W2040347389","https://openalex.org/W1862126075","https://openalex.org/W2113623403","https://openalex.org/W2113270940","https://openalex.org/W2521054645","https://openalex.org/W4389820491","https://openalex.org/W2018076478"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}