Year: 1989
Type: conference-paper
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.
DOI: 10.1145/75427.75463
Authors: M. B. Sharma, N. K. Mandyam, S. S. Iyangar
Institution: Louisiana State University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2059340641
