Random Resource Allocation Graphs and the Probability of Deadlock

DOI10.1137/S0895480192229807MaRDI QIDQ4307052zbMATH OpenOpenAlexFDO

Authors James Lynch

Publication date 26 September 1994

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480192229807

zbMATH Keywords

random graphsresource allocation graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 947017
• Deadlock-freedom in resource contentions
• Design of Minimum-Cost Deadlock-Free Systems
• Revisiting deadlock prevention: a probabilistic approach
• scientific article; zbMATH DE number 4045096

Cited in

(5)

• Digraph representation by its path matrix the particular case of the bipartite graphs
• Infinitary logics and very sparse random graphs
• Revisiting deadlock prevention: a probabilistic approach
• scientific article; zbMATH DE number 947017 (Why is no real title available?)
• Deadlock-freedom in resource contentions

This page was built for publication: Random Resource Allocation Graphs and the Probability of Deadlock

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