Deletion graph problems based on deadlock resolution
From MaRDI portal
Publication:2412401
DOI10.1007/978-3-319-62389-4_7zbMATH Open1434.68046OpenAlexW2726976191MaRDI QIDQ2412401FDOQ2412401
Authors: Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton S. Souza 
Publication date: 23 October 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-62389-4_7
Recommendations
- Deadlock resolution in wait-for graphs by vertex/arc deletion
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem
- Fine-grained parameterized complexity analysis of knot-free vertex deletion -- a deadlock resolution graph problem
- scientific article; zbMATH DE number 947017
- Automata, Languages and Programming
- Optimal deadlock resolutions in edge-disjoint reducible wait-for graphs
- Node-and edge-deletion NP-complete problems
- A distributed deadlock detection algorithm: Distributed graph reconstruction algorithm
- Algorithms for deletion problems on split graphs
- Vertex deletion problems on chordal graphs
Cited In (10)
- A task duplication scheme for resolving deadlocks in clustered dags
- And/or-convexity: a graph convexity based on processes and deadlock models
- Title not available (Why is that?)
- Cooperative Distributed Algorithms for Dynamic Cycle Prevention
- Deadlock resolution in wait-for graphs by vertex/arc deletion
- Easy cases of deadlock detection in train scheduling
- Title not available (Why is that?)
- Fine-grained parameterized complexity analysis of knot-free vertex deletion -- a deadlock resolution graph problem
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem
- Automata, Languages and Programming
This page was built for publication: Deletion graph problems based on deadlock resolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2412401)
