A Distributed Graph Algorithm: Knot Detection.

摘要

A knot in a directed graph is a useful concept in deadlock detection. This paper presents a distributed algorithm based on the work of Dijkstra and Scholten to identify knot in a graph by using a network of processes. (Author)