Login / Signup
Optimal Deadlock Resolutions in Edge-Disjoint Reducible Wait-For Graphs.
Kenneth Luo
William Klostermeyer
Yuan-Chieh Chow
Richard E. Newman-Wolfe
Published in:
Inf. Process. Lett. (1991)
Keyphrases
</>
edge disjoint
spanning tree
dynamic programming
worst case
data sets
social networks
optimal control
minimum cost
graph theoretic
real time
optimal solution
high resolution
directed graph
graph construction
total length