Faster algorithms for finding lowest common ancestors in directed acyclic graphs-Reference-Cited by-同舟云学术

Faster algorithms for finding lowest common ancestors in directed acyclic graphs

Published:2007-06 Issue:1-2 Volume:380 Page:37-46
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Czumaj Artur,Kowaluk Mirosław,Lingas Andrzej

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference18 articles.

1. Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions;Alon;Algorithmica,1996

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. Dynamic LCA queries in trees;Cole;SIAM Journal on Computing,2005

Cited by 35 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Revisiting “Rapid multiplication of rectangular matrices”;Research in Mathematics;2024-08-19

2. New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. $$(\min ,+)$$ Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences;Lecture Notes in Computer Science;2023-12-09

4. Trunk-Branch Tree: A New Tree Structure, can be Divided into Trunk and Branches;2023 5th International Conference on Frontiers Technology of Information and Computer (ICFTIC);2023-11-17

5. Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products;International Journal of Foundations of Computer Science;2023-11-10