Optimal deadlock resolutions in edge-disjoint reducible wait-for graphs

DOI10.1016/0020-0190(91)90087-XzbMath0736.68005MaRDI QIDQ1178247

Kenneth Luo, Yuan-Chieh Chow, William F. Klostermeyer, Richard E. Newman-Wolfe

Publication date: 26 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

distributed systemsresource allocationdominating setminimum feedback vertex setedge-disjoint graph

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Time efficient deadlock resolution algorithms

Cites Work

• A linear algorithm for the domination number of a tree
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal deadlock resolutions in edge-disjoint reducible wait-for graphs