Dynamic cycle detection

DOI10.1016/0020-0190(83)90038-8MaRDI QIDQ1055194zbMATH OpenOpenAlexFDO

Authors Oded Shmueli

Publication date 1983

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(83)90038-8

zbMATH Keywords

directed acyclic graphdynamic graphsresource contentiondepth first searchcentralized continuous deadlock detectiondynamically changing environment

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3481857 (Why is no real title available?)
• scientific article; zbMATH DE number 3635458 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• An On-Line Edge-Deletion Problem
• On-line computation of transitive closures of graphs
• Operating systems. An advanced course
• Parallel concepts in graph theory

Cited in

(1)

• A distributed scheme for dynamic deadlock detection and resolution

This page was built for publication: Dynamic cycle detection

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