Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing
type: Item
instance of: scholarly article
title: Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing
zbMATH Open document ID: 1162.90367
author: Rastislav Královič
author: Peter Ružička
published in: Theoretical Computer Science
publication date: 2009-06-22T00:00:00Z
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 5567394
zbMATH Keywords: communication networks
zbMATH Keywords: packet routing
zbMATH Keywords: acyclic orientation cover
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.10.036
OpenAlex ID: W2101928097
cites work: A group-theoretic model for symmetric interconnection networks
cites work: Q4373669
cites work: Deadlock prevention by acyclic orientations
cites work: Layered cross product&mdashA technique to construct interconnection networks
cites work: Q4262694
cites work: Q5317672
cites work: Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms
cites work: Q4325545
DOI: 10.1016/J.TCS.2006.10.036
description: scientific article; zbMATH DE number 5567394