Optimal deadlock resolutions in edge-disjoint reducible wait-for graphs (Q1178247)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal deadlock resolutions in edge-disjoint reducible wait-for graphs |
scientific article; zbMATH DE number 23352
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal deadlock resolutions in edge-disjoint reducible wait-for graphs |
scientific article; zbMATH DE number 23352 |
Statements
Optimal deadlock resolutions in edge-disjoint reducible wait-for graphs (English)
0 references
26 June 1992
0 references
distributed systems
0 references
resource allocation
0 references
edge-disjoint graph
0 references
minimum feedback vertex set
0 references
dominating set
0 references
