{"id":"https://openalex.org/W1828874726","doi":"https://doi.org/10.1007/978-3-319-24024-4_11","title":"An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs","display_name":"An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1828874726","doi":"https://doi.org/10.1007/978-3-319-24024-4_11","mag":"1828874726"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-24024-4_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-24024-4_11","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/A5026567954","display_name":"Ka Wong Chong","orcid":null},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Ka Wong Chong","raw_affiliation_strings":["Department of Computer Science, The University of Hong-Kong, Porfulam Road, Porfulam, Hong Kong","The University of Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Hong-Kong, Porfulam Road, Porfulam, Hong Kong","institution_ids":[]},{"raw_affiliation_string":"The University of Hong Kong","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014917579","display_name":"Christos Zaroliagis","orcid":"https://orcid.org/0000-0003-1425-5138"},"institutions":[{"id":"https://openalex.org/I120729142","display_name":"Research Academic Computer Technology Institute","ror":"https://ror.org/021nszj63","country_code":"GR","type":"facility","lineage":["https://openalex.org/I120729142","https://openalex.org/I4210154149"]},{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Christos Zaroliagis","raw_affiliation_strings":["Computer Technology Institute and Press \u201cDiophantus\u201d, N. Kazantzaki Str., Patras University Campus, 26504, Patras, Greece","Department of Computer Engineering and Informatics, University of Patras, 26504, Patras, Greece","University of Patras, Patras, Greece","Computer Technology Institute & Press \u201cDiophantus\u201d","University of Patras"],"affiliations":[{"raw_affiliation_string":"Computer Technology Institute and Press \u201cDiophantus\u201d, N. Kazantzaki Str., Patras University Campus, 26504, Patras, Greece","institution_ids":["https://openalex.org/I120729142"]},{"raw_affiliation_string":"Department of Computer Engineering and Informatics, University of Patras, 26504, Patras, Greece","institution_ids":["https://openalex.org/I174878644"]},{"raw_affiliation_string":"University of Patras, Patras, Greece","institution_ids":["https://openalex.org/I174878644"]},{"raw_affiliation_string":"Computer Technology Institute & Press \u201cDiophantus\u201d","institution_ids":["https://openalex.org/I120729142"]},{"raw_affiliation_string":"University of Patras","institution_ids":["https://openalex.org/I174878644"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5026567954"],"corresponding_institution_ids":["https://openalex.org/I889458895"],"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.08067376,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"169","last_page":"182"},"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.9994000196456909,"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.9994000196456909,"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.9993000030517578,"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.9958000183105469,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7832714915275574},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.714838981628418},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6106067895889282},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.606412410736084},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5227301716804504},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.501598596572876},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44831210374832153},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4331853985786438},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.42544716596603394},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4224667251110077},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36512744426727295},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3620583415031433},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2641947865486145}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7832714915275574},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.714838981628418},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6106067895889282},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.606412410736084},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5227301716804504},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.501598596572876},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44831210374832153},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4331853985786438},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.42544716596603394},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4224667251110077},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36512744426727295},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3620583415031433},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2641947865486145},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-319-24024-4_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-24024-4_11","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:CiteSeerX.psu:10.1.1.702.65","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.702.65","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.ceid.upatras.gr/webpages/faculty/zaro/pub/jou/J38-Opt-Par-MST-2015.pdf","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":29,"referenced_works":["https://openalex.org/W1512546754","https://openalex.org/W1584086289","https://openalex.org/W1606654265","https://openalex.org/W1821591339","https://openalex.org/W1965525854","https://openalex.org/W1974807151","https://openalex.org/W1982512167","https://openalex.org/W2011141835","https://openalex.org/W2017492235","https://openalex.org/W2032841680","https://openalex.org/W2035243909","https://openalex.org/W2039895055","https://openalex.org/W2049021301","https://openalex.org/W2050866845","https://openalex.org/W2067661972","https://openalex.org/W2069446854","https://openalex.org/W2094900885","https://openalex.org/W2120490947","https://openalex.org/W2128865241","https://openalex.org/W2138304862","https://openalex.org/W2151440203","https://openalex.org/W2155086352","https://openalex.org/W2156372444","https://openalex.org/W2164485560","https://openalex.org/W2169102947","https://openalex.org/W2338905098","https://openalex.org/W2799004609","https://openalex.org/W4213214460","https://openalex.org/W4249333804"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W4380840098","https://openalex.org/W2044443696","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}