LCA queries in directed acyclic graphs

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 241-248

  Kowaluk, Miroslaw ^a   Lingas, Andrzej ^b  

^a UNIVERSITY OF WARSAW   (Poland)

^b LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; MATRIX ALGEBRA; PROBLEM SOLVING;

DIRECTED ACYCLIC GRAPH (DAG); LOWEST COMMON ANCESTOR (LCA); VERTICES;

GRAPH THEORY;

EID: 26444478558     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_20     Document Type: Conference Paper

References (7)

1. N. Alon and M. Naor. Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect hash functions. Algorithmica 16, pp. 434-449, 1996.
2. M.A. Bender, G. Pemmasani, S. Skiena and P. Sumazin. Finding Least Common Ancestors in Directed Acyclic Graphs. Proc. the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 845-853, 2001.
3. Z. Galil and O. Margalit. Witnesses for Boolean Matrix Multiplication and Shortest Paths. Journal of Complexity, pp. 417-426, 1993.
4. R.W. Cottingham Jr., R.M. Idury, and A.A. Shäffer. Genetic linkage computations. American Journal of Human Genetics, 53, pp. 252-263, 1993.
5. M. Nykänen and E. Ukkonen. Finding lowest common ancestors in arbitrarily directed trees. Inf. Process. Lett., 50(6), pp. 307-310, 1994.
6. A.A. Shäffer, S.K. Gupta, K. Shriram, and R.W. Cottingham Jr. Avoiding recomputation in linkage analysis. Human Heredity, 44, pp. 225-237, 1994.
7. R.E. Tarjan. Applications of path compression on balanced trees. Journal of the ACM 26(4), pp. 690-715, 1979.