An Efficient Method for Storing Ancestor Information in Trees

This publication has 10 references indexed in Scilit:

• Efficient Algorithms for Shortest Paths in Sparse Networks
  Journal of the ACM, 1977
• Design and implementation of an efficient priority queue
  Theory of Computing Systems, 1976
• On Finding Lowest Common Ancestors in Trees
  SIAM Journal on Computing, 1976
• Bibliography on Algorithms for Shortest Path, Shortest Spanning Tree, and Related Circuit Routing Problems (1956–1974)
  Networks, 1975
• Technical Contributions Finding Negative Cycles*
  INFOR: Information Systems and Operational Research, 1973
• Notes—On the Efficiency of a Direct Search Method to Locate Negative Cycles in a Network
  Management Science, 1972
• A Direct Search Method to Locate Negative Cycles in a Graph
  Management Science, 1971
• An algorithm for finding shortest routes from all source nodes to a given destination in general networks
  Quarterly of Applied Mathematics, 1970
• An Appraisal of Some Shortest-Path Algorithms
  Operations Research, 1969
• A Decomposition Algorithm for Shortest Paths in a Network
  Operations Research, 1968