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

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)

Cited in

(9)

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

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)