Some remarks on distributed depth-first search

Information Processing Letters

Volumn 82, Issue 4, 2002, Pages 173-178

  Tsin, Y H ^a  

^a UNIVERSITY OF WINDSOR   (Canada)

Author keywords

Analysis of algorithms; Communication network; Depth first search; Distributed algorithms

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; DATA COMMUNICATION SYSTEMS; DATA TRANSFER; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS);

DISTRIBUTED DEPTH-FIRST SEARCH ALGORITHMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0037204890     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00273-3     Document Type: Article

References (9)

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. Correction to a distributed depth-first-search algorithm
5. Distributed algorithms for depth-first search
6. A time-optimal message-efficient distributed algorithm for depth-first search
7. Depth-first search is inherently sequential
8. An efficient distributed depth-first-search algorithm