论文信息 - Recognizing breadth-first search trees in linear time

Recognizing breadth-first search trees in linear time

Abstract A linear-time algorithm for the following problem is presented: Given an undirected graph G=(V,E) and a spanning tree T of G, determine whether Tcan be the outcome of a breadth-first search on G, and if so, find all possible roots of the breadth-first search.

U. Manbar

[1] Zvi Ostfeld,et al. DFS Tree Construction: Algorithms and Characterizations , 1988, WG.

[2] Robert E. Tarjan,et al. Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..

[3] Uzi Vishkin,et al. Recursive *-tree parallel data-structure , 1989, 30th Annual Symposium on Foundations of Computer Science.

[4] Uzi Vishkin,et al. On Finding Lowest Common Ancestors: Simplification and Parallelization , 1988, AWOC.