Short Labels for Lowest Common Ancestors in Trees

DOI10.1007/978-3-642-04128-0_67MaRDI QIDQ3639288zbMATH OpenOpenAlexFDO

Authors Johannes Fischer

Publication date 29 October 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04128-0_67

Mathematics Subject Classification ID

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

Recommendations

• Near-optimal labeling schemes for nearest common ancestors
• Labeling schemes for nearest common ancestors through minor-universal trees
• Compact labeling schemes for ancestor queries. (Extended abstract)
• scientific article; zbMATH DE number 1830738
• scientific article; zbMATH DE number 2079400

Cited in

(2)

• Labeling schemes for nearest common ancestors through minor-universal trees
• Near-optimal labeling schemes for nearest common ancestors

This page was built for publication: Short Labels for Lowest Common Ancestors in Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3639288)