Optimal bounds for matching routing on trees

被引：0
|
作者：
Zhang, LX
机构：
来源：
PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 1997年
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
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 at most 3/2n + O(log n) steps. This answers an open problem of Alon, Chung and Graham.
引用
收藏
页码：445 / 453
页数：9
相关论文
共 50 条
  • [1] Optimal bounds for matching routing on trees
    Zhang, LX
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1999, 12 (01) : 64 - 77
  • [2] ON OPTIMAL ROUTING TREES
    DU, DZ
    HWANG, FK
    SHING, MT
    WITTBOLD, JT
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1988, 35 (10): : 1335 - 1337
  • [3] On-line matching routing on trees
    Roberts, A
    Symvonis, A
    [J]. LATIN '98: THEORETICAL INFORMATICS, 1998, 1380 : 282 - 291
  • [4] On-line matching routing on trees
    Roberts, A
    Symvonis, A
    [J]. THEORETICAL COMPUTER SCIENCE, 1999, 220 (02) : 469 - 488
  • [5] Bounds on the largest eigenvalues of trees with a given size of matching
    Hou, YP
    Li, JS
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2002, 342 (1-3) : 203 - 217
  • [6] NEAR OPTIMAL BOUNDS FOR STEINER TREES IN THE HYPERCUBE
    Jiang, Tao
    Miller, Zevi
    Pritikin, Dan
    [J]. SIAM JOURNAL ON COMPUTING, 2011, 40 (05) : 1340 - 1360
  • [7] Optimal wavelength routing on directed fiber trees
    Erlebach, T
    Jansen, K
    Kaklamanis, C
    Mihail, M
    Persiano, P
    [J]. THEORETICAL COMPUTER SCIENCE, 1999, 221 (1-2) : 119 - 137
  • [8] Space-Optimal Packet Routing on Trees
    Patt-Shamir, Boaz
    Rosenbaum, Will
    [J]. IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2019), 2019, : 1036 - 1044
  • [9] Bounds on Kemeny?s constant of trees with a prescribed matching number
    Wang, Junming
    Tao, Qiuzhenyu
    [J]. DISCRETE APPLIED MATHEMATICS, 2023, 333 : 121 - 131
  • [10] OPTIMAL TIME-BOUNDS FOR PARALLEL TERM MATCHING
    VERMA, RM
    RAMAKRISHNAN, IV
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1988, 310 : 694 - 703
12345