Routing on trees

DOI10.1016/0020-0190(95)00208-1zbMath0875.68079OpenAlexW2088814615MaRDI QIDQ672097

Antonios Symvonis

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00208-1

zbMATH Keywords

AlgorithmsTreesOff-line routingPermutationRouting modelRouting number

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Direct routing: Algorithms and complexity ⋮ ON THE ROUTING NUMBER OF COMPLETE d-ARY TREES

Cites Work

• A unified framework for off-line permutation routing in parallel networks
• Routing permutations on graphs via matchings
• Unnamed Item

This page was built for publication: Routing on trees