Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing
From MaRDI portal
Publication:1022603
DOI10.1016/j.tcs.2006.10.036zbMath1162.90367MaRDI QIDQ1022603
Rastislav Královič, Peter Ružička
Publication date: 22 June 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.10.036
90B18: Communication networks in operations research
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
05C20: Directed graphs (digraphs), tournaments
Related Items
Cites Work