1. Y. H. Tsin. Some remarks on distributed depth-first search. Information Processing Letters, 82(4):173-178, 2002. ISSN: 0020-0190. [PDF] Keyword(s): Analysis of algorithms, Depth-first search, Distributed algorithm, Communication network.



2. S. A. M. Makki and George Havas. Distributed algorithms for depth-first search. Information Processing Letters, 60(1):7-12, 1996. [PDF] Keyword(s): Distributed system, Depth-first search, Distributed algorithm, communication graph.



3. Alok Aggarwal, Richard J. Anderson, and Ming-Yang Kao. Parallel depth-first search in general directed graphs. SIAM Journal on Computing, 19(2):397-409, 1990. ISSN: 0097-5397. [PDF] Keyword(s): Depth-first search, PRAM.



4. Devendra Kumar, Sitharama S. Iyengar, and Mohan B. Sharma. Corrections to a distributed depth-first search algorithm. Information Processing Letters, 35(1):55-56, 1990. [PDF] Keyword(s): Distributed system, distributed algorithm, communication graph, Depth-first search.



5. Mohan B. Sharma, Sitharama S. Iyengar, and Narasimha K. Mandyam. An efficient distributed depth-first-search algorithm. Information Processing Letters, 32(4):183-186, 1989. [PDF] Keyword(s): Depth-first search, Distributed system, distributed algorithm, communication graph.



6. Isreal Cidon. Yet another distributed depth-first-search algorithm. Information Processing Letters, 26(6):301-305, 1988. [PDF] Keyword(s): Distributed system, distributed algorithm, asynchronous, depth-first-search.



7. K. B. Lakshmanan, N. Meenakshi, and K. Thulasiraman. A time-optimal message-efficient distributed algorithm for depth-first-search. Information Processing Letters, 25(2):103-109, 1987. [PDF] Keyword(s): Depth-first search.



8. Baruch Awerbuch. A new distributed depth-first-search algorithm. Information Processing Letters, 20(3):147-150, 1985. [PDF] Keyword(s): Depth-first search, Distributed system, communication graph.



9. John H. Reif. Depth-First Search is Inherently Sequential. Information Processing Letters, 20(5):229-234, June 1985. [PDF] Keyword(s): Depth-first search, parallel computation, polynomial time complete.

1. Afonso Ferreira, Isabelle Guerin Lassous, K. Marcus, and Andrew Rau-Chaplin. Parallel Computation on Interval Graphs Using PC Clusters: Algorithms and Experiments. In European Conference on Parallel Processing, pages 875-886, 1998. [POSTSCRIPT] Keyword(s): Interval graph, Connected components, Maximum Weighted Clique, Breadth-first Search, Depth-first Search, CGM.



2. Alok Aggarwal and Richard J. Anderson. A random NC algorithm for depth first search. In Proceedings of the nineteenth annual ACM conference on Theory of computing, pages 325-334, 1987. ACM Press. ISBN: 0-89791-221-7. [PDF] Keyword(s): Depth-first search, PRAM.

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.

This document was translated from BibT_EX by bibtex2html