Deletion graph problems based on deadlock resolution (Q2412401)
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: Deletion graph problems based on deadlock resolution |
scientific article; zbMATH DE number 6796715
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deletion graph problems based on deadlock resolution |
scientific article; zbMATH DE number 6796715 |
Statements
Deletion graph problems based on deadlock resolution (English)
0 references
23 October 2017
0 references
deadlock resolution
0 references
knot
0 references
wait-for graphs
0 references
computational complexity
0 references
0.9201895
0 references
0.88874054
0 references
0.8819918
0 references
0 references
0.8649533
0 references
0.84701693
0 references
0.8463811
0 references
0.84502494
0 references
0.83732927
0 references
