{"id":"https://openalex.org/W2109920117","doi":"https://doi.org/10.1137/120864271","title":"Multiple-Source Shortest Paths in Embedded Graphs","display_name":"Multiple-Source Shortest Paths in Embedded Graphs","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2109920117","doi":"https://doi.org/10.1137/120864271","mag":"2109920117"},"language":"en","primary_location":{"id":"doi:10.1137/120864271","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120864271","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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":["University of Ljubljana"],"affiliations":[{"raw_affiliation_string":"University of Ljubljana","institution_ids":["https://openalex.org/I153976015"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011219239","display_name":"Erin Wolf Chambers","orcid":"https://orcid.org/0000-0001-8333-3676"},"institutions":[{"id":"https://openalex.org/I4210121589","display_name":"UCLouvain Saint-Louis Brussels","ror":"https://ror.org/02ygek028","country_code":"BE","type":"education","lineage":["https://openalex.org/I4210121589","https://openalex.org/I95674353"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Erin W. Chambers","raw_affiliation_strings":[", Saint Louis University"],"affiliations":[{"raw_affiliation_string":", Saint Louis University","institution_ids":["https://openalex.org/I4210121589"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042187195","display_name":"Jeff Erickson","orcid":"https://orcid.org/0000-0002-5253-2282"},"institutions":[{"id":"https://openalex.org/I19908199","display_name":"National Center for Supercomputing Applications","ror":"https://ror.org/03g9ch715","country_code":"BG","type":"facility","lineage":["https://openalex.org/I19908199"]}],"countries":["BG"],"is_corresponding":false,"raw_author_name":"Jeff Erickson","raw_affiliation_strings":["National Center for Supercomputing Applications (NCSA)"],"affiliations":[{"raw_affiliation_string":"National Center for Supercomputing Applications (NCSA)","institution_ids":["https://openalex.org/I19908199"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5034923438"],"corresponding_institution_ids":["https://openalex.org/I153976015"],"apc_list":null,"apc_paid":null,"fwci":4.8083,"has_fulltext":false,"cited_by_count":54,"citation_normalized_percentile":{"value":0.95330444,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"42","issue":"4","first_page":"1542","last_page":"1571"},"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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.9983000159263611,"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/combinatorics","display_name":"Combinatorics","score":0.802954912185669},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6424366235733032},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6195985078811646},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6154677867889404},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6052570939064026},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5123263597488403},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4752728044986725},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4498514235019684},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.41948771476745605},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38254594802856445}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.802954912185669},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6424366235733032},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6195985078811646},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6154677867889404},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6052570939064026},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5123263597488403},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4752728044986725},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4498514235019684},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.41948771476745605},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38254594802856445}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/120864271","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120864271","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2974838517","display_name":"AF:Small:Optimization in surface-embedded graphs","funder_award_id":"0915519","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3164374362","display_name":null,"funder_award_id":"J1-4106","funder_id":"https://openalex.org/F4320322554","funder_display_name":"Javna Agencija za Raziskovalno Dejavnost RS"},{"id":"https://openalex.org/G3894112125","display_name":null,"funder_award_id":"P1-0297","funder_id":"https://openalex.org/F4320322554","funder_display_name":"Javna Agencija za Raziskovalno Dejavnost RS"},{"id":"https://openalex.org/G4614525016","display_name":null,"funder_award_id":"CCF-1054779","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6468083095","display_name":null,"funder_award_id":"J1-7218","funder_id":"https://openalex.org/F4320322554","funder_display_name":"Javna Agencija za Raziskovalno Dejavnost RS"},{"id":"https://openalex.org/G6894402473","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7342169334","display_name":"MSPA-MCS: Fundamental Geodesic Problems in Computational Topology","funder_award_id":"0528086","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8112475816","display_name":null,"funder_award_id":"Program","funder_id":"https://openalex.org/F4320322554","funder_display_name":"Javna Agencija za Raziskovalno Dejavnost RS"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320322554","display_name":"Javna Agencija za Raziskovalno Dejavnost RS","ror":"https://ror.org/059bp8k51"},{"id":"https://openalex.org/F4320332222","display_name":"University of Illinois at Urbana-Champaign","ror":"https://ror.org/047426m28"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":66,"referenced_works":["https://openalex.org/W243610207","https://openalex.org/W594463866","https://openalex.org/W1522210445","https://openalex.org/W1537877783","https://openalex.org/W1542290925","https://openalex.org/W1607394607","https://openalex.org/W1715975119","https://openalex.org/W1724567640","https://openalex.org/W1816717522","https://openalex.org/W1928375144","https://openalex.org/W1965690159","https://openalex.org/W1969625919","https://openalex.org/W1971057413","https://openalex.org/W1971258090","https://openalex.org/W1974358136","https://openalex.org/W1977155699","https://openalex.org/W1980410492","https://openalex.org/W1981234161","https://openalex.org/W1992869351","https://openalex.org/W2004086384","https://openalex.org/W2006152944","https://openalex.org/W2006428587","https://openalex.org/W2008597108","https://openalex.org/W2018804864","https://openalex.org/W2021547908","https://openalex.org/W2022163094","https://openalex.org/W2025861110","https://openalex.org/W2030435702","https://openalex.org/W2030509174","https://openalex.org/W2038643780","https://openalex.org/W2040112642","https://openalex.org/W2048285065","https://openalex.org/W2048790997","https://openalex.org/W2057266558","https://openalex.org/W2060296641","https://openalex.org/W2064175146","https://openalex.org/W2078443814","https://openalex.org/W2084224084","https://openalex.org/W2086474457","https://openalex.org/W2088455492","https://openalex.org/W2089016801","https://openalex.org/W2091264711","https://openalex.org/W2091720300","https://openalex.org/W2097289283","https://openalex.org/W2102559438","https://openalex.org/W2104835758","https://openalex.org/W2106299112","https://openalex.org/W2120424341","https://openalex.org/W2142947709","https://openalex.org/W2147508044","https://openalex.org/W2147510331","https://openalex.org/W2153523737","https://openalex.org/W2166937960","https://openalex.org/W2169528473","https://openalex.org/W2199785256","https://openalex.org/W2326954772","https://openalex.org/W2569270235","https://openalex.org/W2570206580","https://openalex.org/W2610479830","https://openalex.org/W2610830343","https://openalex.org/W2762935521","https://openalex.org/W3101337733","https://openalex.org/W3105140593","https://openalex.org/W3139290474","https://openalex.org/W4213048098","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W2023670982","https://openalex.org/W1862126075","https://openalex.org/W78560857","https://openalex.org/W2521054645"],"abstract_inverted_index":{"Let":[0],"$G$":[1,67],"be":[2,26,69],"a":[3,18,34,108,133],"directed":[4,14],"graph":[5,40],"with":[6,46,148,165],"$n$":[7],"vertices":[8],"and":[9,23],"nonnegative":[10],"weights":[11,163],"in":[12,41,66,71,100,139,143,156],"its":[13,112],"edges,":[15],"embedded":[16],"on":[17,57,92],"surface":[19],"of":[20,30,60,83,86,120,125],"genus":[21],"$g$,":[22],"let":[24],"$f$":[25,61],"an":[27,123,166],"arbitrary":[28,172],"face":[29],"$G$.":[31],"We":[32],"describe":[33,129],"randomized":[35],"algorithm":[36,82,106],"to":[37,62,131],"preprocess":[38],"the":[39,51,58,79,87,118,157],"$O(gn":[42],"\\log":[43],"n)$":[44,73,146,169],"time":[45,147,153],"high":[47,149],"probability,":[48],"so":[49],"that":[50],"shortest-path":[52,109],"distance":[53],"from":[54],"any":[55,63],"vertex":[56,65],"boundary":[59,119],"other":[64],"can":[68],"retrieved":[70],"$O(\\log":[72,168],"time.":[74],"Our":[75,151],"result":[76],"directly":[77],"generalizes":[78],"$O(n\\log":[80],"n)$-time":[81],"Klein":[84],"[Proceedings":[85],"16th":[88],"Annual":[89],"ACM-SIAM":[90],"Symposium":[91],"Discrete":[93],"Algorithms,":[94],"2005]":[95],"for":[96,160,171],"multiple-source":[97],"shortest":[98,134],"paths":[99],"planar":[101],"graphs.":[102],"Intuitively,":[103],"our":[104,126],"preprocessing":[105],"maintains":[107],"tree":[110],"as":[111],"source":[113],"point":[114],"moves":[115],"continuously":[116],"around":[117],"$f$.":[121],"As":[122],"application":[124],"algorithm,":[127],"we":[128],"algorithms":[130],"compute":[132],"noncontractible":[135],"or":[136,164],"nonseparating":[137],"cycle":[138],"embedded,":[140],"undirected":[141],"graphs":[142],"$O(g^2":[144],"n\\log":[145],"probability.":[150],"high-probability":[152],"bounds":[154],"hold":[155],"worst":[158],"case":[159],"generic":[161],"edge":[162,173],"additional":[167],"factor":[170],"weights.":[174]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}