Compact name-independent routing with minimum stretch
From MaRDI portal
Publication:4962742
DOI10.1145/1367064.1367077zbMath1445.68143MaRDI QIDQ4962742
Dahlia Malkhi, Cyril Gavoille, Ittai Abraham, Mikkel Thorup, Noam Nisan
Publication date: 5 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.77.6034
68R10: Graph theory (including graph drawing) in computer science
Related Items
Shortest-path queries in static networks, Compact roundtrip routing with topology-independent node names, Distributed algorithms for ultrasparse spanners and linear size skeletons, \(k\)-chordal graphs: from cops and robber to compact routing via treewidth, Space-efficient path-reporting approximate distance oracles, Electric routing and concurrent flow cutting, Strong-diameter decompositions of minor free graphs, Labeling schemes for tree representation, Distance estimation and object location via rings of neighbors, Sparse covers for planar graphs and graphs that exclude a fixed minor, Name-independent compact routing in trees, On Approximate Distance Labels and Routing Schemes with Affine Stretch