Optimal bounds for matching routing on trees

被引：10
|
作者：
Zhang, LX [1 ]
机构：
[1] Kent Ridge Digital Labs, Bioinformat Ctr, Kent Ridge 119613, Singapore
来源：
SIAM JOURNAL ON DISCRETE MATHEMATICS | 1999年 / 12卷 / 01期
关键词：
matching routing; off-line algorithms; trees;
D O I：
10.1137/S0895480197323159
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutation on an n-node tree (and thus graph) can be routed in 3/2n + O(log n) steps. This answers an open problem of Alon, Chung, and Graham [SIAM J. Discrete Math., 7 (1994), pp. 516-530].
引用
收藏
页码：64 / 77
页数：14
相关论文
共 50 条
12345