Work

An optimal distributed depth-first-search algorithm

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.
Language: English
Open Access status: bronze
OpenAlex ID: W2059340641
FWCI: 0.711
Cites: 5
Cited by: 14
Related to: 10