ON THE ROUTING NUMBER OF COMPLETE d-ARY TREES

DOI10.1142/S0129054101000564zbMath1319.68160MaRDI QIDQ5249268

Antonios Symvonis, Alan Roberts

Publication date: 30 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

permutationtreesroutingmatching model

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Routing on trees
• Building heaps in parallel
• Parallel heap: an optimal parallel priority queue
• Dimension-exchange token distribution on the mesh and the torus
• Parallel heap operations on an EREW PRAM
• Many-to-many routing on trees via matchings
• Optimal Bounds for Matching Routing on Trees
• Routing Permutations on Graphs via Matchings

This page was built for publication: ON THE ROUTING NUMBER OF COMPLETE d-ARY TREES