Simple, efficient distributed depth-first-search algorithms /
Abstract: "This paper presents simple and efficient distributed depth-first-search algorithms which require exactly 2( [absolute value of V] - 1) messages and [absolute value of V] time units."
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Book |
| Language: | English |
| Published: |
College Station, Tex. :
Texas A & M University, Computer Science Dept.,
[1993]
|
| Series: | Technical report (Texas A & M University. Computer Science Department) ;
93-010. |
| Subjects: |
| Summary: | Abstract: "This paper presents simple and efficient distributed depth-first-search algorithms which require exactly 2( [absolute value of V] - 1) messages and [absolute value of V] time units." |
|---|---|
| Item Description: | Cover title. "March 9, 1993"--P. 1. |
| Physical Description: | 9 leaves : illustrations ; 28 cm. |
| Bibliography: | Includes bibliographical references. |