Avoiding deadlocks via weak deadlock sets

DOI10.1002/NET.22275MaRDI QIDQ6971577zbMATH OpenFDO

Authors Gianpaolo Oriolo, Anna Russo Russo

Publication date 13 June 2025

Published in Networks (Search for Journal in Brave)

zbMATH Keywords

treescomplexity analysisdeadlockbound to deadlock statedeadlock-avoidance algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)

This page was built for publication: Avoiding deadlocks via weak deadlock sets

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