An optimal ancestry scheme and small universal posets

DOI10.1145/1806689.1806773zbMath1293.68143OpenAlexW2002270599MaRDI QIDQ2875188

Pierre Fraigniaud, Amos Korman

Publication date: 13 August 2014

Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1806689.1806773

zbMATH Keywords

XMLpartially ordered setsinformative labeling schemes

Mathematics Subject Classification ID

Partial orders, general (06A06) Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Related Items

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