An optimal distributed depth-first-search algorithm

Authors:
M. B. Sharma;N. K. Mandyam;S. S. Iyangar
Affiliations:
Department of Computer Science, Louisiana State University, Baton Rouge, LA;Department of Computer Science, Louisiana State University, Baton Rouge, LA;Indian Telephone Industries Ltd., Bangalore, India
Venue:
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Year:
1989

Citing 2
Cited 3

A time-optimal message-efficient distributed algorithm for depth-first-search

Information Processing Letters
Yet another distributed depth-first-search algorithm

Information Processing Letters

On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay

IEEE Transactions on Mobile Computing
Trade-off scheme for fault tolerant connected dominating sets on size and diameter

Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Link scheduling in wireless sensor networks: Distributed edge-coloring revisited

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new distributed depth-first-search algorithm with communication and time complexities of O(|V|). The algorithm is shown to use 2|V|-2 messages and 2|V|-2 units of time and is shown to be optimal in time and message.