Deletion graph problems based on deadlock resolution

DOI10.1007/978-3-319-62389-4_7zbMath1434.68046OpenAlexW2726976191MaRDI QIDQ2412401

Uéverton S. Souza, Alan Diêgo Aurélio Carneiro, Fábio Protti

Publication date: 23 October 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-62389-4_7

zbMATH Keywords

computational complexityknotdeadlock resolutionwait-for graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Related Items (2)

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

This page was built for publication: Deletion graph problems based on deadlock resolution