An efficient distributed depth-first-search algorithm

Information Processing Letters

Volumn 32, Issue 4, 1989, Pages 183-186

  Sharma, Mohan B ^a   Iyengar, Sitharama S ^a   Mandyam, Narasimha K ^b  

^a LOUISIANA STATE UNIVERSITY   (United States)

^b Indian Telephone Industries   (India)

Author keywords

communication graph; distributed algorithm; Distributed system

Indexed keywords

COMPUTERS, DIGITAL--DATA COMMUNICATION SYSTEMS; MATHEMATICAL TECHNIQUES--ALGORITHMS;

DEPTH-FIRST-SEARCH ALGORITHM; DISTRIBUTED SYSTEMS;

COMPUTER NETWORKS;

EID: 0024732804     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(89)90041-0     Document Type: Article

References (8)

1. A new distributed depth-first-search algorithm
2. Graph traversal techniques and the maximum flow problem in distributed computation
3. Yet another distributed depth-first-search algorithm
4. Resynch procedures and a fail-safe network protocol
5. A time optimal message-efficient distributed algorithm for depth-first-search
6. Depth-first search is inherently sequential