Compact Labeling Scheme for Ancestor Queries

DOI10.1137/S0097539703437211zbMath1101.68103WikidataQ109512887 ScholiaQ109512887MaRDI QIDQ5470735

Stephen Alstrup, Haim Kaplan, Theis Rauhe, Tova Milo, Serge Abiteboul

Publication date: 1 June 2006

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: http://epubs.siam.org/SICOMP/volume-35/art_43721.html

zbMATH Keywords

rooted treelabeling algorithmalphabetic codesancestor queries

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (8)

A Simple and Optimal Ancestry Labeling Scheme for Trees ⋮ Adjacency Labeling Schemes and Induced-Universal Graphs ⋮ Compact separator decompositions in dynamic trees and applications to labeling schemes ⋮ Drawing maps with advice ⋮ Distributed Relationship Schemes for Trees ⋮ Compressed subsequence matching and packed tree coloring ⋮ A note on models for graph representations ⋮ Short Labels by Traversal and Jumping

This page was built for publication: Compact Labeling Scheme for Ancestor Queries