{"id":"https://openalex.org/W2903797494","doi":"https://doi.org/10.1145/3218821","title":"Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs","display_name":"Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs","publication_year":2018,"publication_date":"2018-12-07","ids":{"openalex":"https://openalex.org/W2903797494","doi":"https://doi.org/10.1145/3218821","mag":"2903797494"},"language":"en","primary_location":{"id":"doi:10.1145/3218821","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3218821","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5034923438","display_name":"Sergio Cabello","orcid":"https://orcid.org/0000-0002-3183-4126"},"institutions":[{"id":"https://openalex.org/I153976015","display_name":"University of Ljubljana","ror":"https://ror.org/05njb9z20","country_code":"SI","type":"education","lineage":["https://openalex.org/I153976015"]}],"countries":["SI"],"is_corresponding":true,"raw_author_name":"Sergio Cabello","raw_affiliation_strings":["Department of Mathematics, FMF, University of Ljubljana, Slovenia and Department of Mathematics, IMFM, Slovenia"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, FMF, University of Ljubljana, Slovenia and Department of Mathematics, IMFM, Slovenia","institution_ids":["https://openalex.org/I153976015"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5034923438"],"corresponding_institution_ids":["https://openalex.org/I153976015"],"apc_list":null,"apc_paid":null,"fwci":12.8724,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.98744113,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"15","issue":"2","first_page":"1","last_page":"38"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9991999864578247,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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.993399977684021,"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.7891525030136108},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.7258939743041992},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7000115513801575},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.6544119715690613},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5676817297935486},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5658107399940491},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.44382616877555847},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.44189926981925964},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.423282265663147},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.41484975814819336},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2573903203010559},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1458911895751953},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06968548893928528}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7891525030136108},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.7258939743041992},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7000115513801575},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.6544119715690613},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5676817297935486},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5658107399940491},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.44382616877555847},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.44189926981925964},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.423282265663147},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.41484975814819336},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2573903203010559},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1458911895751953},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06968548893928528},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3218821","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3218821","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7528479177","display_name":null,"funder_award_id":"Program P1-0297, Projects No. J1-8130 and No. J1-8155","funder_id":"https://openalex.org/F4320322554","funder_display_name":"Javna Agencija za Raziskovalno Dejavnost RS"}],"funders":[{"id":"https://openalex.org/F4320322554","display_name":"Javna Agencija za Raziskovalno Dejavnost RS","ror":"https://ror.org/059bp8k51"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1551891681","https://openalex.org/W1597730645","https://openalex.org/W1791386552","https://openalex.org/W1968647828","https://openalex.org/W1979836315","https://openalex.org/W1987221468","https://openalex.org/W1988593903","https://openalex.org/W2001907516","https://openalex.org/W2015545367","https://openalex.org/W2024654848","https://openalex.org/W2028558845","https://openalex.org/W2047489708","https://openalex.org/W2060075372","https://openalex.org/W2065759448","https://openalex.org/W2078191188","https://openalex.org/W2096304547","https://openalex.org/W2103099082","https://openalex.org/W2109920117","https://openalex.org/W2113679823","https://openalex.org/W2120424341","https://openalex.org/W2166242192","https://openalex.org/W2182608044","https://openalex.org/W2293041988","https://openalex.org/W2561675875","https://openalex.org/W2570172216","https://openalex.org/W2589084166","https://openalex.org/W2768149714","https://openalex.org/W2952685572","https://openalex.org/W2988480584","https://openalex.org/W3139290474","https://openalex.org/W3195461621","https://openalex.org/W4252017042"],"related_works":["https://openalex.org/W2487162673","https://openalex.org/W2793211469","https://openalex.org/W2949152769","https://openalex.org/W4372354731","https://openalex.org/W2942366970","https://openalex.org/W2298045254","https://openalex.org/W2121031403","https://openalex.org/W2951009394","https://openalex.org/W4297697596","https://openalex.org/W1915344978"],"abstract_inverted_index":{"In":[0,45],"this":[1],"article,":[2],"we":[3,55],"show":[4],"how":[5],"to":[6,96],"compute":[7,58],"for":[8,35,77,87],"n":[9,16,19,48,51,84],"-vertex":[10],"planar":[11,99],"graphs":[12,37],"in":[13],"O":[14,46,82],"(":[15,47,83],"11/6":[17],"polylog(":[18,50],"))":[20,52],"expected":[21,53],"time":[22,81],"the":[23,26,29,59,74],"diameter":[24],"and":[25,41],"sum":[27],"of":[28,61,63],"pairwise":[30],"distances.":[31],"The":[32],"algorithms":[33,76],"work":[34],"directed":[36],"with":[38],"real":[39],"weights":[40],"no":[42],"negative":[43],"cycles.":[44],"15/8":[49],"time,":[54],"can":[56],"also":[57],"number":[60],"pairs":[62],"vertices":[64],"at":[65],"distances":[66],"smaller":[67],"than":[68],"a":[69],"given":[70],"threshold.":[71],"These":[72],"are":[73],"first":[75],"these":[78],"problems":[79],"using":[80],"c":[85,90],")":[86],"some":[88],"constant":[89],"<":[91],"2,":[92],"even":[93],"when":[94],"restricted":[95],"undirected,":[97],"unweighted":[98],"graphs.":[100]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}