Cooperative Distributed Algorithms for Dynamic Cycle Prevention
Shmuel M. Katz, Oded Shmueli · IEEE Transactions on Software Engineering · 1987
Parallel distributed algorithms are presented for adding and deleting edges in a directed graph without creating a cycle. Such algorithms are useful for a variety of problems in distributed systems such as preventing deadlock or ordering priorities. The algorithms operate in a realistic asynchronous computer network environment in which there are numerous possible interactions among overlapping instances of the algorithms.