{"id":"https://openalex.org/W2208938718","doi":"https://doi.org/10.1145/2935764.2935777","title":"Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford","display_name":"Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford","publication_year":2016,"publication_date":"2016-07-08","ids":{"openalex":"https://openalex.org/W2208938718","doi":"https://doi.org/10.1145/2935764.2935777","mag":"2208938718"},"language":"en","primary_location":{"id":"doi:10.1145/2935764.2935777","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2935764.2935777","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-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/A5006631025","display_name":"Stephan Friedrichs","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Stephan Friedrichs","raw_affiliation_strings":["Max Planck Institute for Informatics, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006005471","display_name":"Christoph Lenzen","orcid":"https://orcid.org/0000-0002-3290-0674"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christoph Lenzen","raw_affiliation_strings":["Max Planck Institute for Informatics, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006631025"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":null,"apc_paid":null,"fwci":2.0908,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.87394518,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"455","last_page":"466"},"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.9966999888420105,"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.9966999888420105,"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/embedding","display_name":"Embedding","score":0.7697533369064331},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6764007806777954},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.5749924182891846},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5664450526237488},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5568046569824219},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5208138227462769},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5112597942352295},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.478452205657959},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4659968614578247},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4240581691265106},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4106512665748596},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2787542939186096},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2595599889755249},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07629472017288208},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07591170072555542},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06298786401748657}],"concepts":[{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.7697533369064331},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6764007806777954},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.5749924182891846},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5664450526237488},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5568046569824219},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5208138227462769},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5112597942352295},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.478452205657959},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4659968614578247},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4240581691265106},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4106512665748596},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2787542939186096},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2595599889755249},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07629472017288208},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07591170072555542},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06298786401748657},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2935764.2935777","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2935764.2935777","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W10324078","https://openalex.org/W816673839","https://openalex.org/W1500245277","https://openalex.org/W1507039213","https://openalex.org/W1538106700","https://openalex.org/W1568961751","https://openalex.org/W1593224779","https://openalex.org/W1965996575","https://openalex.org/W1969080501","https://openalex.org/W1981859328","https://openalex.org/W1983097829","https://openalex.org/W2012931756","https://openalex.org/W2014317399","https://openalex.org/W2027018686","https://openalex.org/W2040273581","https://openalex.org/W2041571997","https://openalex.org/W2049500052","https://openalex.org/W2056496054","https://openalex.org/W2058295780","https://openalex.org/W2076458424","https://openalex.org/W2083323175","https://openalex.org/W2085630237","https://openalex.org/W2092938419","https://openalex.org/W2104507648","https://openalex.org/W2112702616","https://openalex.org/W2114493937","https://openalex.org/W2120248756","https://openalex.org/W2125528794","https://openalex.org/W2126356486","https://openalex.org/W2133156969","https://openalex.org/W2169143327","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2618199688","https://openalex.org/W2952490263","https://openalex.org/W2964310428","https://openalex.org/W3030774092","https://openalex.org/W3138807513","https://openalex.org/W4285719527","https://openalex.org/W6635405524"],"related_works":["https://openalex.org/W2081900870","https://openalex.org/W2345479200","https://openalex.org/W2183306018","https://openalex.org/W2849310602","https://openalex.org/W3006008237","https://openalex.org/W2163788280","https://openalex.org/W2419146053","https://openalex.org/W2898790172","https://openalex.org/W1941306591","https://openalex.org/W150528880"],"abstract_inverted_index":{"A":[0],"metric":[1,103],"tree":[2,21,73],"embedding":[3],"of":[4,92],"expected":[5,90],"stretch":[6,91],"\u03b1":[7,44,93],"maps":[8],"a":[9,19,102],"weighted":[10,20],"n-node":[11],"graph":[12],"G":[13],"=":[14,23],"(V,":[15],"E,":[16],"w)":[17],"to":[18,70,76],"T":[22],"(VT,":[24],"ET,":[25],"wT)":[26],"with":[27],"V":[28],"\u2286":[29],"VT,":[30],"and":[31,39,100],"dist(v,":[32,36,45],"w,":[33,37,41,46],"G)":[34,47],"\u2264":[35,43],"T)":[38],"E[dist(v,":[40],"T)]":[42],"for":[48,59],"all":[49],"v,":[50],"w":[51],"\u2208":[52,94],"V.":[53],"Such":[54],"embeddings":[55],"are":[56,68],"highly":[57],"useful":[58],"designing":[60],"fast":[61],"approximation":[62],"algorithms,":[63],"as":[64,104],"many":[65],"hard":[66],"problems":[67],"easy":[69],"solve":[71],"on":[72],"instances.":[74],"However,":[75],"date":[77],"the":[78],"best":[79],"parallel":[80],"polylog":[81],"n":[82],"depth":[83],"algorithm":[84],"that":[85],"achieves":[86],"an":[87],"asymptotically":[88],"optimal":[89],"\u03a9(log":[95],"n)":[96],"uses":[97],"\u03a9(n2)":[98],"work":[99],"requires":[101],"input.":[105]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}