On a simple deadlock recovery problem

DOI10.1016/0020-0190(83)90118-7zbMath0514.90024OpenAlexW2020116604MaRDI QIDQ1051555

Errol L. Lloyd

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)90118-7

zbMATH Keywords

polynomial time algorithmnetwork flow problemdeadlock

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)

Cites Work

• Maximal Flow Through a Network
• A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a simple deadlock recovery problem