Optimal Bounds for Matching Routing on Trees

DOI10.1137/S0895480197323159zbMATH Open0933.68008MaRDI QIDQ4255808FDOQ4255808

Authors: Louxin Zhang 

Publication date: 27 June 1999

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Recommendations

• Routing on trees via matchings
• Routing on trees
• On-line matching routing on trees
• ON THE ROUTING NUMBER OF COMPLETE d-ARY TREES

zbMATH Keywords

treesoff-line algorithmsmatching routing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Cited In (16)

• Dynamic tree routing under the “matching with consumption” model
• Shortest augmenting paths for online matchings on trees
• Waypoint routing on bounded treewidth graphs
• ON THE ROUTING NUMBER OF COMPLETE d-ARY TREES
• New results on routing via matchings on graphs
• On the complexity of an optimal routing tree problem
• Extremal permutations in routing cycles
• Title not available (Why is that?)
• A unified framework for the expander mixing lemma for irregular graphs and its applications
• Routeing on trees
• Routing permutations on spectral expanders via matchings
• Title not available (Why is that?)
• Collision-free network exploration
• Title not available (Why is that?)
• Routing on trees via matchings
• The time complexity of permutation routing via matching, token swapping and a variant

This page was built for publication: Optimal Bounds for Matching Routing on Trees

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