An Efficient Method for Storing Ancestor Information in Trees

DOI10.1137/0208048MaRDI QIDQ3854663zbMATH OpenOpenAlexFDO

Authors David Maier

Publication date 1979

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

Full work available at URL https://doi.org/10.1137/0208048

zbMATH Keywords

computing ancestor information in treeslowest common ancestornegative cyclessparse graphsstoring informationtree algorithms

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Cited in

(5)

• Maintaining order in a generalized linked list
• The nearest common ancestor in a dynamic tree
• A data structure for dynamic trees
• Searching and encoding for infinite ordered sets
• Parallel dynamic lowest common ancestors

This page was built for publication: An Efficient Method for Storing Ancestor Information in Trees

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