On a simple deadlock recovery problem

DOI10.1016/0020-0190(83)90118-7MaRDI QIDQ1051555zbMATH OpenOpenAlexFDO

Authors 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

• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• scientific article; zbMATH DE number 3314878 (Why is no real title available?)
• A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
• Maximal Flow Through a Network

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

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