An Efficient Method for Storing Ancestor Information in Trees

DOI10.1137/0208048zbMath0421.68089OpenAlexW1984271780MaRDI QIDQ3854663

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

sparse graphsnegative cycleslowest common ancestortree algorithmscomputing ancestor information in treesstoring information

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items

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