On Minimum Cost Recovery from System Deadlock

DOI10.1109/TC.1979.1675435zbMath0414.68019OpenAlexW1854990080MaRDI QIDQ3049811

Edmund K. Lai, Joseph Y.-T. Leung

Publication date: 1979

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1979.1675435

zbMATH Keywords

approximation algorithmsaverage-case performanceminimum cost deadlock recoveryNp-complete problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99)

Related Items

On enumerating all minimal solutions of feedback problems ⋮ Deadlock resolution in wait-for graphs by vertex/arc deletion ⋮ Time efficient deadlock resolution algorithms ⋮ On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem