{"id":"https://openalex.org/W2002536646","doi":"https://doi.org/10.1007/s00453-012-9641-7","title":"A Linear-Time Algorithm for Finding Locally Connected Spanning Trees on Circular-Arc Graphs","display_name":"A Linear-Time Algorithm for Finding Locally Connected Spanning Trees on Circular-Arc Graphs","publication_year":2012,"publication_date":"2012-03-23","ids":{"openalex":"https://openalex.org/W2002536646","doi":"https://doi.org/10.1007/s00453-012-9641-7","mag":"2002536646"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-012-9641-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-012-9641-7","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"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/A5064871646","display_name":"Ching\u2010Chi Lin","orcid":"https://orcid.org/0000-0002-9518-2809"},"institutions":[{"id":"https://openalex.org/I153512688","display_name":"National Taiwan Ocean University","ror":"https://ror.org/03bvvnt49","country_code":"TW","type":"education","lineage":["https://openalex.org/I153512688"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Ching-Chi Lin","raw_affiliation_strings":["Department of Computer Science and Engineering, National Taiwan Ocean University, Keelung, 20224, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, National Taiwan Ocean University, Keelung, 20224, Taiwan","institution_ids":["https://openalex.org/I153512688"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004968111","display_name":"Gen-Huey Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Gen-Huey Chen","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Taiwan University, Taipei, 10617, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Taiwan University, Taipei, 10617, Taiwan","institution_ids":["https://openalex.org/I16733864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002508116","display_name":"Gerard J. Chang","orcid":null},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]},{"id":"https://openalex.org/I4210119858","display_name":"National Center for Theoretical Sciences","ror":"https://ror.org/02mfp0b67","country_code":"TW","type":"facility","lineage":["https://openalex.org/I4210119858"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Gerard J. Chang","raw_affiliation_strings":["Department of Mathematics, National Taiwan University, Taipei, 10617, Taiwan","National Center for Theoretical Sciences, Taipei Office, Taipei, 10617, Taiwan","Taida Institute for Mathematical Sciences, National Taiwan University, Taipei, 10617, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, National Taiwan University, Taipei, 10617, Taiwan","institution_ids":["https://openalex.org/I16733864"]},{"raw_affiliation_string":"National Center for Theoretical Sciences, Taipei Office, Taipei, 10617, Taiwan","institution_ids":["https://openalex.org/I4210119858"]},{"raw_affiliation_string":"Taida Institute for Mathematical Sciences, National Taiwan University, Taipei, 10617, Taiwan","institution_ids":["https://openalex.org/I16733864"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5004968111"],"corresponding_institution_ids":["https://openalex.org/I16733864"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.08874301,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"66","issue":"2","first_page":"369","last_page":"396"},"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.9979000091552734,"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/T10720","display_name":"Complexity and Algorithms in Graphs","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.7978023290634155},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6923211216926575},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6853533387184143},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.5997933149337769},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5500704646110535},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.5453937649726868},{"id":"https://openalex.org/keywords/intersection-graph","display_name":"Intersection graph","score":0.5249452590942383},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.5209509134292603},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5181902050971985},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4809695780277252},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4636792838573456},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4616144895553589},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.4480831027030945},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.4454887807369232},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.42542245984077454},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41415220499038696},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4138174057006836},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2977586090564728},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.289755642414093},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.18747544288635254},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.10416266322135925},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.05973559617996216}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7978023290634155},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6923211216926575},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6853533387184143},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.5997933149337769},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5500704646110535},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.5453937649726868},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.5249452590942383},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.5209509134292603},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5181902050971985},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4809695780277252},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4636792838573456},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4616144895553589},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.4480831027030945},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.4454887807369232},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.42542245984077454},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41415220499038696},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4138174057006836},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2977586090564728},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.289755642414093},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.18747544288635254},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.10416266322135925},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.05973559617996216}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-012-9641-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-012-9641-7","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W642281457","https://openalex.org/W1589045381","https://openalex.org/W1971826280","https://openalex.org/W1973146956","https://openalex.org/W1980392938","https://openalex.org/W1986824573","https://openalex.org/W2006048213","https://openalex.org/W2024491681","https://openalex.org/W2032853328","https://openalex.org/W2037551081","https://openalex.org/W2044531679","https://openalex.org/W2049520215","https://openalex.org/W2052473415","https://openalex.org/W2057405567","https://openalex.org/W2060722839","https://openalex.org/W2068361557","https://openalex.org/W2071867466","https://openalex.org/W2072141822","https://openalex.org/W2082095538","https://openalex.org/W2084535093","https://openalex.org/W2132816737","https://openalex.org/W2143474538","https://openalex.org/W2156334902","https://openalex.org/W4242336842"],"related_works":["https://openalex.org/W2014991506","https://openalex.org/W2082872574","https://openalex.org/W2307044859","https://openalex.org/W2779648845","https://openalex.org/W2201964723","https://openalex.org/W2052473415","https://openalex.org/W1754127855","https://openalex.org/W2002489000","https://openalex.org/W4231142277","https://openalex.org/W2002536646"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}