Computing on a free tree via complexity-preserving mappings
- 1 January 1984
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 358-368
- https://doi.org/10.1109/sfcs.1984.715936
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Finding kth paths and p-centers by generating and searching good data structuresJournal of Algorithms, 1983
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location ProblemsSIAM Journal on Computing, 1981
- An Optimal Worst Case Algorithm for Reporting Intersections of RectanglesIEEE Transactions on Computers, 1980
- Applications of Path Compression on Balanced TreesJournal of the ACM, 1979
- A class of algorithms which require nonlinear time to maintain disjoint setsJournal of Computer and System Sciences, 1979
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975