{"id":"https://openalex.org/W3034833218","doi":"https://doi.org/10.1145/3382734.3405719","title":"Computing Shortest Paths and Diameter in the Hybrid Network Model","display_name":"Computing Shortest Paths and Diameter in the Hybrid Network Model","publication_year":2020,"publication_date":"2020-07-31","ids":{"openalex":"https://openalex.org/W3034833218","doi":"https://doi.org/10.1145/3382734.3405719","mag":"3034833218"},"language":"en","primary_location":{"id":"doi:10.1145/3382734.3405719","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3382734.3405719","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2006.08408","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023808567","display_name":"Fabian K\u00fchn","orcid":"https://orcid.org/0000-0002-1025-5037"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Fabian Kuhn","raw_affiliation_strings":["University of Freiburg","Albert-Ludwigs Univ. of Freiburg"],"affiliations":[{"raw_affiliation_string":"University of Freiburg","institution_ids":["https://openalex.org/I161046081"]},{"raw_affiliation_string":"Albert-Ludwigs Univ. of Freiburg","institution_ids":["https://openalex.org/I161046081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056528455","display_name":"Philipp Schneider","orcid":"https://orcid.org/0000-0001-9660-1270"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Philipp Schneider","raw_affiliation_strings":["University of Freiburg","Albert-Ludwigs Univ. of Freiburg"],"affiliations":[{"raw_affiliation_string":"University of Freiburg","institution_ids":["https://openalex.org/I161046081"]},{"raw_affiliation_string":"Albert-Ludwigs Univ. of Freiburg","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023808567"],"corresponding_institution_ids":["https://openalex.org/I161046081"],"apc_list":null,"apc_paid":null,"fwci":0.58835243,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.72309063,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"109","last_page":"118"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9983999729156494,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9980999827384949,"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/logarithm","display_name":"Logarithm","score":0.6596376895904541},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.653928279876709},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5168936252593994},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.493689626455307},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.49002039432525635},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4508287310600281},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43885213136672974},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42912983894348145},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.41687873005867004},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3881411850452423},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.33795398473739624},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.17116954922676086},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.16538327932357788}],"concepts":[{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6596376895904541},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.653928279876709},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5168936252593994},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.493689626455307},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.49002039432525635},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4508287310600281},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43885213136672974},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42912983894348145},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.41687873005867004},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3881411850452423},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.33795398473739624},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.17116954922676086},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.16538327932357788},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/3382734.3405719","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3382734.3405719","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2006.08408","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2006.08408","pdf_url":"https://arxiv.org/pdf/2006.08408","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:3034833218","is_oa":true,"landing_page_url":"http://arxiv.org/pdf/2006.08408.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:freidok.uni-freiburg.de:174257","is_oa":false,"landing_page_url":"https://freidok.uni-freiburg.de/data/174257","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 39th Symposium on Principles of Distributed Computing. - New York, NY, USA, 2020. - 109-118, ISBN: 978-1-4503-7582-5","raw_type":"article_in_conference_proceedings"},{"id":"doi:10.48550/arxiv.2006.08408","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2006.08408","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2006.08408","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2006.08408","pdf_url":"https://arxiv.org/pdf/2006.08408","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3034833218.pdf","grobid_xml":"https://content.openalex.org/works/W3034833218.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W147275194","https://openalex.org/W1568961751","https://openalex.org/W1582638066","https://openalex.org/W1605733898","https://openalex.org/W1980223785","https://openalex.org/W1996066664","https://openalex.org/W1999123717","https://openalex.org/W2040011014","https://openalex.org/W2040273581","https://openalex.org/W2048098617","https://openalex.org/W2054910423","https://openalex.org/W2063844956","https://openalex.org/W2070486524","https://openalex.org/W2075862701","https://openalex.org/W2082336059","https://openalex.org/W2083323175","https://openalex.org/W2107282727","https://openalex.org/W2112702616","https://openalex.org/W2115412108","https://openalex.org/W2119638333","https://openalex.org/W2120248756","https://openalex.org/W2139535340","https://openalex.org/W2511108295","https://openalex.org/W2739619775","https://openalex.org/W2762590152","https://openalex.org/W2949524113","https://openalex.org/W2950813619","https://openalex.org/W2952490263","https://openalex.org/W2952500888","https://openalex.org/W2962960360","https://openalex.org/W2963015907","https://openalex.org/W2963245981","https://openalex.org/W2963489806","https://openalex.org/W2963983116","https://openalex.org/W2974335994","https://openalex.org/W3001053786","https://openalex.org/W3046430097","https://openalex.org/W4256354285"],"related_works":["https://openalex.org/W3001053786","https://openalex.org/W3038196379","https://openalex.org/W2294996551","https://openalex.org/W1563931143","https://openalex.org/W40930839","https://openalex.org/W1515735476","https://openalex.org/W2937030569","https://openalex.org/W2982350313","https://openalex.org/W2963618817","https://openalex.org/W3046699603","https://openalex.org/W1496451055","https://openalex.org/W2784293985","https://openalex.org/W2923900523","https://openalex.org/W3098776817","https://openalex.org/W2083795876","https://openalex.org/W2511922371","https://openalex.org/W1575611224","https://openalex.org/W2568718018","https://openalex.org/W2617317032","https://openalex.org/W2061591914"],"abstract_inverted_index":{"The":[0,21,91],"$\\mathsf{HYBRID}$":[1,92,130],"model,":[2],"introduced":[3],"in":[4,88],"[Augustine":[5,165],"et":[6,166],"al.,":[7,167],"SODA":[8,168],"'20],":[9],"provides":[10],"a":[11,42,56,67,244],"theoretical":[12],"foundation":[13],"for":[14,155,176,189,206,214,247],"networks":[15],"that":[16,186],"allow":[17],"multiple":[18],"communication":[19,39,58,109,116,145,229],"modes.":[20,40],"model":[22,93,131],"follows":[23],"the":[24,63,89,97,124,129,134,143,151,156,177,207,220,224,227,233,248],"principles":[25],"of":[26,55,78,99,128,136,142,222,226],"synchronous":[27],"message":[28],"passing,":[29],"whereas":[30],"nodes":[31,46,87],"are":[32,193],"allowed":[33],"to":[34,62,95,122,173,197],"use":[35],"\\textit{two}":[36],"fundamentally":[37],"different":[38],"First,":[41],"local":[43,57,108,144,228],"mode":[44,69],"where":[45,70,104],"may":[47,73],"exchange":[48,74],"arbitrary":[49,86],"information":[50],"per":[51,83],"round":[52,84],"over":[53],"edges":[54],"graph":[59,146],"$G$":[60],"(akin":[61],"$\\mathsf{LOCAL}$":[64],"model).":[65],"Second,":[66],"global":[68,115],"every":[71],"node":[72],"$O(\\log":[75,80],"n)$":[76,81],"messages":[77],"size":[79],"bits":[82],"with":[85,112,117,216],"network.":[90],"intends":[94],"reflect":[96],"conditions":[98],"many":[100],"real":[101],"hybrid":[102],"networks,":[103],"high-bandwidth":[105],"but":[106],"inherently":[107],"is":[110,241],"combined":[111],"highly":[113],"flexible":[114],"restricted":[118],"bandwidth.":[119],"We":[120,148,184],"continue":[121],"explore":[123],"power":[125],"and":[126,140,170,191],"limitations":[127],"by":[132,243],"investigating":[133],"complexity":[135],"computing":[137],"shortest":[138,160,180,211],"paths":[139,161,181,212],"diameter":[141,225,250],"$G$.":[147],"improve":[149],"on":[150],"known":[152],"upper":[153,236,239],"bound":[154,240,246],"exact":[157,208,249],"all":[158],"pairs":[159],"problem":[162,182,213,221],"(APSP)":[163],"from":[164],"'20]":[169],"provide":[171],"algorithms":[172],"approximate":[174],"solutions":[175],"$k$":[178],"source":[179,210],"($k$-SSSP).":[183],"demonstrate":[185],"our":[187],"results":[188],"APSP":[190],"$k$-SSP":[192],"almost":[194],"tight":[195],"(up":[196],"poly-logarithmic":[198],"factors).":[199],"Furthermore,":[200],"we":[201,231],"give":[202,232],"an":[203],"improved":[204],"algorithm":[205],"single":[209],"graphs":[215],"large":[217],"diameter.":[218],"For":[219],"approximating":[223],"network":[230],"first":[234],"non-trivial":[235],"bound.":[237],"This":[238],"complemented":[242],"lower":[245],"problem.":[251]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}