All-pairs disjoint paths from a common ancestor in over(O, ̃) (nω) time

Theoretical Computer Science

Volumn 396, Issue 1-3, 2008, Pages 145-150

  Yuster, Raphael ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

Algorithm; Common ancestor; Directed acyclic graph; Fast matrix multiplication

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATION THEORY; PROBLEM SOLVING;

COMMON ANCESTOR; DIRECTED ACYCLIC GRAPH; FAST MATRIX MULTIPLICATION; LOWEST COMMON ANCESTOR;

GRAPH THEORY;

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

References (15)

1. Alon N., and Naor M. Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica 16 (1996) 434-449
2. Bender M.A., Farach-Colton M., Pemmasani G., Skiena S., and Sumazin P. Lowest common ancestors in trees and directed acyclic graphs. Journal of Algorithms 57 2 (2005) 75-94
3. Berkman O., and Vishkin U. Finding level-ancestors in trees. Journal of Computer and System Sciences 48 2 (1994) 214-230
4. Coppersmith D. Rectangular matrix multiplication revisited. Journal of Complexity 13 (1997) 42-49
5. Coppersmith D., and Winograd S. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation 9 (1990) 251-280
6. Czumaj A., Kowaluk M., and Lingas A. Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Theoretical Computer Science 380 1-2 (2007) 37-46
7. Eckhardt S., Mühling A., and Nowak J. Fast lowest common ancestor computations in dags. Proceedings of the 15th Annual European Symposium on Algorithms. ESA. Lecture Notes in Computer Science vol. 4698 (2007), Springer 705-716
8. Furman M.E. Application of a method of fast multiplication of matrices in the problem of finding the transitive closure of a graph. Doklady Akademii Nauk SSSR 11 5 (1970) 1252
9. Harel D., and Tarjan R.E. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing 13 2 (1984) 338-355
10. Huang X., and Pan V.Y. Fast rectangular matrix multiplications and applications. Journal of Complexity 14 (1998) 257-299
11. Kowaluk M., and Lingas A. LCA queries in directed acyclic graphs. Proceedings of the 32nd International Colloquium on Automata, Languages, and Programming. ICALP. Lecture Notes in Computer Science vol. 3580 (2005), Springer 241-248
12. Kowaluk M., and Lingas A. Unique lowest common ancestors in dags are almost as easy as matrix multiplication. Proceedings of the 15th Annual European Symposium on Algorithms. ESA. Lecture Notes in Computer Science vol. 4698 (2007), Springer 265-274
13. I. Munro, Efficient determination of the strongly connected components and the transitive closure of a graph, Univ. of Toronto, Toronto, Canada, 1971 (unpublished manuscript)
14. Schieber B., and Vishkin U. On finding lowest common ancestors: Simplification and parallelization. SIAM Journal on Computing 17 (1988) 1253-1262
15. Zwick U. All-pairs shortest paths using bridging sets and rectangular matrix multiplication. Journal of the ACM 49 (2002) 289-317