Deadlock resolution in wait-for graphs by vertex/arc deletion
From MaRDI portal
Publication:2420655
DOI10.1007/s10878-018-0279-5zbMath1420.90075MaRDI QIDQ2420655
Fábio Protti, Uéverton S. Souza, Alan Diêgo Aurélio Carneiro
Publication date: 6 June 2019
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-018-0279-5
computational complexity; knot; deadlock recovery; vertex deletion; directed feedback vertex set; deadlock resolution; wait-for graphs
90C35: Programming involving graphs or networks