Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published October 1982 | public
Journal Article

A Distributed Graph Algorithm: Knot Detection

Abstract

A knot in a directed graph is a useful concept in deadlock detection. A distributed algorithm for identifying a knot in a graph by using a network of processes is presented. The algorithm is based on the work of Dijkstra and Scholten.

Additional Information

© 1982 ACM. Received September 1981; revised May 1982; accepted May 1982. Supported in part by the Air Force under grant AFOSR 81-0205. We gratefully acknowledge the suggestions of E. W. Dijkstra and C. S. Scholten, on whose work this paper is based. We are also grateful to two anonymous referees for their valuable comments.

Additional details

Created:
August 19, 2023
Modified:
October 20, 2023