A new distributed Depth-First-Search algorithm

doi:10.1016/0020-0190(85)90083-3

Information Processing Letters

Volume 20, Issue 3, 8 April 1985, Pages 147-150

https://doi.org/10.1016/0020-0190(85)90083-3 Get rights and content

Abstract

This paper presents a new distributed Depth-First-Search (DFS) algorithm for an asynchronous communication network, whose communication and time complexities are O(|E|) and O(|V|), respectively. The output of the algorithm is the DFS tree, kept in a distributed fashion. The existing algorithm, due to Cheung (1983), requires O(|E|) both in communication and time complexities.

References (5)

T. Cheung
Graph traversal techniques and the maximum flow problem in distributed computation
IEEE Trans. Software Engineering
(1983)
E.J.H. Chang
Echo algorithms: Depth parallel operations on general graphs
IEEE Trans. Software Engineering
(1982)

There are more references available in the full text version of this article.

Cited by (134)

Large-scale generation and characterization of amorphous boron nitride and its mechanical properties in atomistic simulations
2021, Journal of Non-Crystalline Solids
Citation Excerpt :
The ring analysis is carried out via the Depth-First Search (DFS) algorithm. DFS is a recursive algorithm for traversing or searching a tree, which starts at the node and explores as far as possible along each branch before backtracking [41]. The backtracking ensures that each ring is identified only once in the DFS algorithm.
In this paper, a simple and effective strategy for generating the microstructure of a-BN is firstly proposed based on classical molecular dynamics methods, and then is validated by characterizing the microstructure. The characterization analysis show that: i) a-BN with different densities and microstructures could be successfully generated mainly composed of the B₃N₃ hexagonal ring; ii) a-BN constructed by the combinations of the basic structural units with small size is more reasonable; iii) high-density a-BN, obtained at either high annealing temperature or high initial density, has discretely distributed micro-voids with larger scattering size distribution. The microstructure of the generated a-BN is subjected to tensile loading simulation, and the results showed the Young's modulus and fracture strength increase with increasing annealing temperature or initial density. During the tensile process, the micro-voids in high-density of a-BN gradually undergoes expansion, elongation, and mergence stages, and the ultimate fracture of a-BN.
Ip-Gcn: A Deep Learning Hybrid Approach to Predict Influence in Complex Networks
2024, SSRN
A Scalable Real-Time SDN-Based MQTT Framework for Industrial Applications
2024, IEEE Open Journal of the Industrial Electronics Society
An Ontology-Driven Approach for Process-Aware Risk Propagation
2023, Proceedings of the ACM Symposium on Applied Computing
Robust H∞ State Estimation for Distribution System Considering Randomly Missing Measurements
2023, IEEE Transactions on Instrumentation and Measurement
Bayesian Network Structure Learning for Node Order Optimization Based on Improved Genetic-Wolf Pack Algorithm
2023, Jiliang Xuebao/Acta Metrologica Sinica

View all citing articles on Scopus

^∗: Present affiliation: Computer Science Laboratory, MIT, Cambridge, MA 02139, U.S.A.

View full text

A new distributed Depth-First-Search algorithm

Abstract

Graph traversal techniques and the maximum flow problem in distributed computation

IEEE Trans. Software Engineering

Echo algorithms: Depth parallel operations on general graphs

IEEE Trans. Software Engineering