Optimal Bounds for Matching Routing on Trees
From MaRDI portal
Publication:4255808
DOI10.1137/S0895480197323159zbMath0933.68008MaRDI QIDQ4255808
Publication date: 27 June 1999
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
Collision-free network exploration ⋮ The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant ⋮ Unnamed Item ⋮ Extremal permutations in routing cycles ⋮ ON THE ROUTING NUMBER OF COMPLETE d-ARY TREES
This page was built for publication: Optimal Bounds for Matching Routing on Trees