{"id":"https://openalex.org/W2981494155","doi":"https://doi.org/10.1016/j.ipl.2019.105873","title":"An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time","display_name":"An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time","publication_year":2019,"publication_date":"2019-10-24","ids":{"openalex":"https://openalex.org/W2981494155","doi":"https://doi.org/10.1016/j.ipl.2019.105873","mag":"2981494155"},"language":"en","primary_location":{"id":"doi:10.1016/j.ipl.2019.105873","doi":"https://doi.org/10.1016/j.ipl.2019.105873","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.ipl.2019.105873","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},"volume":null,"type":"article","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/A5086851146","display_name":"Feodor F. Dragan","orcid":"https://orcid.org/0000-0001-5147-7747","observed_orcids":["https://orcid.org/0000-0001-5147-7747"]},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Feodor F. Dragan","raw_affiliation_strings":["Algorithmic Research Laboratory, Department of Computer Science, Kent State University, Kent, OH, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithmic Research Laboratory, Department of Computer Science, Kent State University, Kent, OH, USA","institution_ids":["https://openalex.org/I149910238"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5086851146"],"corresponding_institution_ids":["https://openalex.org/I149910238"],"apc_list":{"value":1500,"currency":"USD","value_usd":1500},"apc_paid":null,"fwci":0.8176,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.73248667,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":"154","issue":null,"first_page":"105873","last_page":"105873"},"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.9746000170707703,"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.9746000170707703,"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.024399999529123306,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.0005000000237487257,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/chordal-graphs","display_name":"chordal graphs","score":0.9919999837875366},{"id":"https://openalex.org/keywords/spanning-trees","display_name":"spanning trees","score":0.9190000295639038},{"id":"https://openalex.org/keywords/graph-eccentricity","display_name":"graph eccentricity","score":0.7929999828338623},{"id":"https://openalex.org/keywords/linear-time-algorithms","display_name":"linear-time algorithms","score":0.8610000014305115},{"id":"https://openalex.org/keywords/additive-approximation","display_name":"additive approximation","score":0.5220000147819519},{"id":"https://openalex.org/keywords/one-sided-error","display_name":"one-sided error","score":0.6729999780654907}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8141181468963623},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.6938697099685669},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6600315570831299},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.641618013381958},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6103906631469727},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.5268691182136536},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4966619610786438},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4491191506385803},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43805402517318726},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.07214081287384033}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.ipl.2019.105873","doi":"https://doi.org/10.1016/j.ipl.2019.105873","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.ipl.2019.105873","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1989214692","https://openalex.org/W1996471450","https://openalex.org/W2047489708","https://openalex.org/W2060275064","https://openalex.org/W2072141822","https://openalex.org/W2082613046","https://openalex.org/W2086119402","https://openalex.org/W2091612923","https://openalex.org/W2134304205","https://openalex.org/W2142780976","https://openalex.org/W2143474538","https://openalex.org/W2750540289","https://openalex.org/W2804916770","https://openalex.org/W2914168686","https://openalex.org/W4299866835","https://openalex.org/W6647432503","https://openalex.org/W6662263969","https://openalex.org/W6681555618"],"related_works":["https://openalex.org/W2006955534","https://openalex.org/W2153789027","https://openalex.org/W1987143101","https://openalex.org/W1994156213","https://openalex.org/W2251679127","https://openalex.org/W2272336114","https://openalex.org/W2124526408","https://openalex.org/W2407722793","https://openalex.org/W2020877234","https://openalex.org/W2584187496"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1}],"updated_date":"2026-09-21T07:43:02.447757","created_date":"2025-10-10T00:00:00"}