A Simple and Optimal Ancestry Labeling Scheme for Trees

DOI10.1007/978-3-662-47666-6_45zbMath1440.68048arXiv1407.5011OpenAlexW2247301512MaRDI QIDQ3449505

Mathias Bæk Tejs Knudsen, Noy Rotbart, Søren Dahlgaard

Publication date: 4 November 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nearest common ancestors: a survey and a new algorithm for a distributed environment
• An optimal ancestry scheme and small universal posets
• Labeling schemes for vertex connectivity
• Adjacency Labeling Schemes and Induced-Universal Graphs
• Labeling Dynamic XML Trees
• Implicat Representation of Graphs
• Finding Dominators in Directed Graphs
• Labeling Schemes for Flow and Connectivity
• Distance labeling in graphs
• Near-optimal labeling schemes for nearest common ancestors
• Compact Labeling Scheme for Ancestor Queries
• Labeling Schemes for Small Distances in Trees

This page was built for publication: A Simple and Optimal Ancestry Labeling Scheme for Trees