Interval routing on layered cross product of trees and cycles

DOI10.1007/3-540-48311-X_174MaRDI QIDQ4945787zbMATH OpenFDO

Authors Rastislav Královič, Branislav Rovan, Peter Ružička

Publication date 7 June 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48311-X_174

zbMATH Keywords

interconnection networkspath interval routing schemes

Mathematics Subject Classification ID

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

Recommendations

• Interval routing \(\and\) layered cross product: compact routing schemes for butterflies, meshes of trees, fat trees and Beneš networks
• On interval routing schemes and treewidth
• On the complexity of multi-dimensional interval routing schemes
• Interval Routing onk-Trees
• Interval routing schemes for circular-arc graphs
• Multi-dimensional Interval Routing Schemes
• Multidimensional interval routing schemes
• The Compactness of Interval Routing
• scientific article; zbMATH DE number 1517100
• On the dilation of interval routing

Cited in

(3)

• Interval routing \(\and\) layered cross product: compact routing schemes for butterflies, meshes of trees, fat trees and Beneš networks
• Layered cross product&mdashA technique to construct interconnection networks
• Low-congested interval routing schemes for hypercubelike networks

This page was built for publication: Interval routing on layered cross product of trees and cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4945787)