Recognizing Unordered Depth-First Search Trees of an Undirected Graph in Parallel

Authors:
Chen-Hsing Peng;Biing-Feng Wang;Jia-Shung Wang
Affiliations:
TaiChung Veterans General Hospital, TaiChung, Taiwan, Republic of China;National Tsing Hua Univ., Hsinchu, Taiwan, Republic of China;National Tsing Hua Univ., Hsinchu, Taiwan, Republic of China
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2000

Citing 11
Cited 0

Approximate parallel scheduling. Part I: the basic technique with applications to optimal parallel list ranking in logarithmic time

SIAM Journal on Computing
A parallel algorithm for recognizing unordered depth-first search

Information Processing Letters
On finding lowest common ancestors: simplification and parallelization

SIAM Journal on Computing
Parallel depth-first search in general directed graphs

SIAM Journal on Computing
Recognizing breadth-first search trees in linear time

Information Processing Letters
Planar depth-first search in O(log n) parallel time

SIAM Journal on Computing
A unified approach to parallel depth-first traversals of general trees

Information Processing Letters
An introduction to parallel algorithms

An introduction to parallel algorithms
Recognizing shortest-path trees in linear time

Information Processing Letters
Applications of Path Compression on Balanced Trees

Journal of the ACM (JACM)
DFS Tree Construction: Algorithms and Characterizations

WG '88 Proceedings of the 14th International Workshop on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.02

Visualization

Abstract

Let $G$ be an undirected graph and $T$ be a spanning tree of $G$. In this paper, an efficient parallel algorithm is proposed for determining whether $T$ is an unordered depth-first search tree of $G$. The proposed algorithm runs in $O(m/p + \log m)$ time using $p$ processors on the EREW PRAM, where $m$ is the number of edges contained in $G$. It is cost-optimal and achieves linear speedup.