A Caltech Library Service

A Distributed Graph Algorithm: Knot Detection

Misra, J. and Chandy, K. M. (1982) A Distributed Graph Algorithm: Knot Detection. ACM Transactions on Programming Languages and Systems (TOPLAS), 4 (4). pp. 678-686. ISSN 0164-0925.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


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.

Item Type:Article
Related URLs:
URLURL TypeDescription
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.
Funding AgencyGrant Number
Air Force Office of Scientific Research (AFOSR)81-0205
Subject Keywords:Distributed algorithms, message communication, knot
Issue or Number:4
Record Number:CaltechAUTHORS:20190110-150349106
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:92205
Deposited By: Tony Diaz
Deposited On:11 Jan 2019 05:04
Last Modified:03 Oct 2019 20:42

Repository Staff Only: item control page