A Distributed Graph Algorithm for the Detection of Local Cycles and Knots

@article{Boukerche1998ADG,
  title={A Distributed Graph Algorithm for the Detection of Local Cycles and Knots},
  author={Azzedine Boukerche and Carl Tropper},
  journal={IEEE Trans. Parallel Distrib. Syst.},
  year={1998},
  volume={9},
  pages={748-757}
}
In this paper, a distributed cycle/knot detection algorithm for general graphs is presented. The algorithm distinguishes between cycles and knots and is the first algorithm to our knowledge which does so. It is especially relevant to an application such as parallel simulation in which 1) cycles and knots can arise frequently, 2) the size of the graph is very large, and 3) it is necessary to know if a given node is in a cycle or a knot. It requires less communication than previous algorithms—2m… CONTINUE READING
Highly Cited
This paper has 34 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 23 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Performance Analysis of Distributed Simulation with Clustered Processes

  • A. Boukerche, C. Tropper
  • Proc. SCS Multiconf. Advances in Parallel and…
  • 1991
Highly Influential
4 Excerpts

On Distributed and Pseudosimulation

  • C. Cote, C. Tropper
  • Proc. SCS Multiconf. Parallel and Distributed…
  • 1992
1 Excerpt

Local Deadlock Detection in Distributed Simulation

  • L. Z. Liu, C. Tropper
  • Proc. 1990 Distributed Simulation Conf., vol. 22…
  • 1990
2 Excerpts

Similar Papers

Loading similar papers…