A Distributed Graph Algorithm: Knot Detection

DOI10.1145/69622.357190MaRDI QIDQ3951562zbMATH OpenOpenAlexFDO

Authors 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

deadlock detectiondistributed algorithmsmessage communicationnetwork of processesnetwork operating systems

Mathematics Subject Classification ID

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

Cited in

(9)

• 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
• Parallel simulation on the hypercube multiprocessor
• Self stabilization in distributed knot detection
• An efficient distributed algorithm for finding all hinge vertices in networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3951562)