Sublinear Distance Labeling
From MaRDI portal
Publication:4606270
DOI10.4230/LIPIcs.ESA.2016.5zbMath1397.68128arXiv1507.02618OpenAlexW2963393443MaRDI QIDQ4606270
Søren Dahlgaard, Stephen Alstrup, Ely Porat, Mathias Bæk Tejs Knudsen
Publication date: 2 March 2018
Full work available at URL: https://arxiv.org/abs/1507.02618
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Data structures (68P05)
Related Items (8)
Better distance labeling for unweighted planar graphs ⋮ An adjacency labeling scheme based on a decomposition of trees into caterpillars ⋮ Implicit representation of relations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Better distance labeling for unweighted planar graphs ⋮ Unnamed Item ⋮ Isometric Universal Graphs
This page was built for publication: Sublinear Distance Labeling
