Pages that link to "Item:Q2412401"
From MaRDI portal
The following pages link to Deletion graph problems based on deadlock resolution (Q2412401):
Displaying 7 items.
- A task duplication scheme for resolving deadlocks in clustered dags (Q436204) (← links)
- And/or-convexity: a graph convexity based on processes and deadlock models (Q1639288) (← links)
- Fine-grained parameterized complexity analysis of knot-free vertex deletion -- a deadlock resolution graph problem (Q1790957) (← links)
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem (Q2078619) (← links)
- Deadlock resolution in wait-for graphs by vertex/arc deletion (Q2420655) (← links)
- Easy Cases of Deadlock Detection in Train Scheduling (Q5106357) (← links)
- Automata, Languages and Programming (Q5716833) (← links)