A Distributed Graph Algorithm: Knot Detection
From MaRDI portal
Publication:3951562
DOI10.1145/69622.357190zbMath0489.68061MaRDI QIDQ3951562
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
distributed algorithms; deadlock detection; message communication; network operating systems; network of processes
68R10: Graph theory (including graph drawing) in computer science
68N25: Theory of operating systems
Related Items
Parallel simulation on the hypercube multiprocessor, SELF STABILIZATION IN DISTRIBUTED KNOT DETECTION, An efficient distributed algorithm for finding all hinge vertices in networks, Distributed processing of graphs: Fundamental cycles algorithm, An optimal distributed algorithm for recognizing mesh-connected networks, An efficient distributed bridge-finding algorithm, On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem, Deadlock resolution in wait-for graphs by vertex/arc deletion, On the message complexity of distributed problems