Near-optimal labeling schemes for nearest common ancestors

DOI10.1137/1.9781611973402.72zbMath1422.68041arXiv1312.4413OpenAlexW2134373920MaRDI QIDQ5384034

Kasper Green Larsen, Stephen Alstrup, Esben Bistrup Halvorsen

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Data structures (68P05)

Related Items (4)

A Simple and Optimal Ancestry Labeling Scheme for Trees ⋮ Adjacency Labeling Schemes and Induced-Universal Graphs ⋮ Unnamed Item ⋮ Shorter Labeling Schemes for Planar Graphs

This page was built for publication: Near-optimal labeling schemes for nearest common ancestors