Faster algorithms for finding lowest common ancestors in directed acyclic graphs

Theoretical Computer Science

Volumn 380, Issue 1-2, 2007, Pages 37-46

  Czumaj, Artur ^a   Kowaluk, Mirosław ^b   Lingas, Andrzej ^c  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b UNIVERSITY OF WARSAW   (Poland)

^c LUND UNIVERSITY   (Sweden)

Author keywords

Directed acyclic graphs; Lowest common ancestors; Matrix multiplication; Time complexity

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL EFFICIENCY; MATRIX ALGEBRA; PROBLEM SOLVING;

DIRECTED ACYCLIC GRAPHS; LOWEST COMMON ANCESTORS; MATRIX MULTIPLICATION; TIME COMPLEXITY;

GRAPH THEORY;

EID: 34248548511     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.02.053     Document Type: Article

References (18)

1. Alon N., and Naor M. Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica 16 (1996) 434-449
2. A. Becker, D. Geiger, A.A. Schaeffer, Automatic selection of loop breakers for genetic linkage analysis
3. M.A. Bender, M. Farach-Colton, The LCA problem revisited, in: Proc. 4th Latin American Symposium on Theoretical Informatics, LATIN'00, 2000, pp. 88-93
4. M.A. Bender, G. Pemmasani, S. Skiena, P. Sumazin, Finding least common ancestors in directed acyclic graphs, in: Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'01, 2001, pp. 845-853
5. Cole R., and Hariharan R. Dynamic LCA queries in trees. SIAM Journal on Computing 34 4 (2005) 894-923
6. Coppersmith D. Rectangular matrix multiplication revisited. Journal of Symbolic Computation 13 (1997) 42-49
7. Coppersmith D., and Winograd S. Matrix multiplication via arithmetic progression. Journal of Symbolic Computation 9 (1990) 251-290
8. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms. 2nd ed. (2001), McGraw-Hill Book Company, Boston, MA
9. Cottingham Jr. R.W., Idury R.M., and Shäffer A.A. Genetic linkage computations. American Journal of Human Genetics 53 (1993) 252-263
10. A. Czumaj, A. Lingas, Improved algorithms for the all-pairs lowest common ancestor problem in directed acyclic graphs, 2005, Manuscript
11. Galil Z., and Margalit O. Witnesses for Boolean matrix multiplication and for transitive closure. Journal of Complexity 9 (1993) 201-221
12. Harel D., and Tarjan R.E. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing 13 2 (1984) 338-355
13. Huang X., and Pan V.Y. Fast rectangular matrix multiplications and applications. Journal of Complexity 14 (1998) 257-299
14. M. Kowaluk, A. Lingas, LCA queries in directed acyclic graphs, in: Proc. 32nd International Colloquium on Automata, Languages and Programming, ICALP'05, 2005, pp. 241-248
15. Nykänen M., and Ukkonen E. Finding lowest common ancestors in arbitrarily directed trees. Information Processing Letters 50 6 (1994) 307-310
16. Shäffer A.A., Gupta S.K., Shriram K., and Cottingham Jr. R.W. Avoiding recomputation in linkage analysis. Human Heredity 44 (1994) 225-237
17. Tarjan R.E. Applications of path compression on balanced trees. Journal of the ACM 26 4 (1979) 690-715
18. Zwick U. All pairs shortest paths using bridging sets and rectangular matrix multiplication. Journal of the ACM 49 3 (2002) 289-317