Near Optimal Adjacency Labeling Schemes for Power-Law Graphs

DOI10.4230/LIPIcs.ICALP.2016.133zbMath1388.68239arXiv1502.03971OpenAlexW2962915997MaRDI QIDQ4598276

Christian Wulff-Nilsen, Casper Petersen, Noy Rotbart, Jakob Grue Simonsen

Publication date: 19 December 2017

Full work available at URL: https://arxiv.org/abs/1502.03971

zbMATH Keywords

power-law graphslabeling schemes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (5)

Better distance labeling for unweighted planar graphs ⋮ Implicit representation of relations ⋮ Better distance labeling for unweighted planar graphs ⋮ Fault-tolerant distance labeling for planar graphs ⋮ Fault-tolerant distance labeling for planar graphs

This page was built for publication: Near Optimal Adjacency Labeling Schemes for Power-Law Graphs