Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference4 articles.
1. Recursive ∗-tree parallel data structure;Berkman,1989
2. Fast algorithms for finding nearest common ancestors;Harel;SIAM J. Comput.,1984
3. DFS tree construction: Algorithms and characterizations;Korach;the 14th International Workshop on Graph-Theoretic Concepts in Computer Science,1988
4. On finding lowest common ancestors: Simplification and parallelization;Schieber;SIAM J. Comput.,1988
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Recognizing LBFS trees of bipartite graphs;Information Processing Letters;2024-08
2. Graph Search Trees and Their Leaves;Graph-Theoretic Concepts in Computer Science;2023
3. On the recognition of search trees generated by BFS and DFS;Theoretical Computer Science;2022-11
4. The Recognition Problem of Graph Search Trees;SIAM Journal on Discrete Mathematics;2021-01
5. Graph Traversal;Texts in Computer Science;2021