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. © 1982, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
APA
Misra, J., & Chandy, K. M. (1982). A Distributed Graph Algorithm: Knot Detection. ACM Transactions on Programming Languages and Systems (TOPLAS), 4(4), 678–686. https://doi.org/10.1145/69622.357190
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free