Near-Optimal Induced Universal Graphs for Bounded Degree Graphs

DOI10.4230/LIPIcs.ICALP.2017.128zbMath1447.05179arXiv1607.04911MaRDI QIDQ5111460

Morten Stöckel, Mikkel Abrahamsen, Mathias Bæk Tejs Knudsen, Jacob Holm, Stephen Alstrup

Publication date: 27 May 2020

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

zbMATH Keywords

distributed computingbounded-degree graphsinduced universal graphsadjacency labeling schemes

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex degrees (05C07)

Related Items (3)

An adjacency labeling scheme based on a decomposition of trees into caterpillars ⋮ Near-optimal induced universal graphs for cycles and paths ⋮ Optimal induced universal graphs for bounded-degree graphs

This page was built for publication: Near-Optimal Induced Universal Graphs for Bounded Degree Graphs