A Distributed Graph Algorithm: Knot Detection

DOI10.1145/69622.357190zbMath0489.68061OpenAlexW2142302732MaRDI QIDQ3951562

K. Mani Chandy, Jayadev Misra

Publication date: 1982

Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/69622.357190

zbMATH Keywords

distributed algorithmsdeadlock detectionmessage communicationnetwork operating systemsnetwork of processes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of operating systems (68N25)

Related Items (9)

An efficient distributed bridge-finding algorithm ⋮ Deadlock resolution in wait-for graphs by vertex/arc deletion ⋮ Parallel simulation on the hypercube multiprocessor ⋮ Distributed processing of graphs: Fundamental cycles algorithm ⋮ SELF STABILIZATION IN DISTRIBUTED KNOT DETECTION ⋮ On the message complexity of distributed problems ⋮ An efficient distributed algorithm for finding all hinge vertices in networks ⋮ On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem ⋮ An optimal distributed algorithm for recognizing mesh-connected networks

This page was built for publication: A Distributed Graph Algorithm: Knot Detection