Near-optimal simulations of trees by Fibonacci cubes

被引：0
|
作者：
Cong, B. [1 ]
Zheng, S.Q. [1 ]
机构：
[1] California State Univ, Fullerton, United States
来源：
International Journal of Parallel and Distributed Systems and Networks | 2000年 / 3卷 / 01期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：34 / 38
相关论文
共 50 条
  • [1] Near-optimal embeddings of trees into Fibonacci cubes
    Cong, B
    Zheng, SQ
    [J]. PROCEEDINGS OF THE TWENTY-EIGHTH SOUTHEASTERN SYMPOSIUM ON SYSTEM THEORY, 1996, : 421 - 425
  • [2] Near-optimal Nonlinear Regression Trees
    Bertsimas, Dimitris
    Dunn, Jack
    Wang, Yuchen
    [J]. OPERATIONS RESEARCH LETTERS, 2021, 49 (02) : 201 - 206
  • [3] ON FINDING OPTIMAL AND NEAR-OPTIMAL LINEAL SPANNING-TREES
    FELLOWS, MR
    FRIESEN, DK
    LANGSTON, MA
    [J]. ALGORITHMICA, 1988, 3 (04) : 549 - 560
  • [4] ON THE COSTS OF OPTIMAL AND NEAR-OPTIMAL BINARY SEARCH-TREES
    ALLEN, B
    [J]. ACTA INFORMATICA, 1982, 18 (03) : 255 - 263
  • [5] Search trees with relaxed balance and near-optimal height
    Fagerberg, R
    Jensen, RE
    Larsen, KS
    [J]. ALGORITHMS AND DATA STRUCTURES, 2001, 2125 : 414 - 425
  • [6] Near-optimal bounded-degree spanning trees
    J. C. Hansen
    E. Schmutz
    [J]. Algorithmica, 2001, 29 : 148 - 180
  • [7] Near-optimal allocation of delay requirements on multicast trees
    Tran, HT
    Harris, RJ
    [J]. CONVERGED NETWORKING: DATA AND REAL-TIME COMMUNICATIONS OVER IP, 2003, 119 : 325 - 339
  • [8] Near-optimal hot-potato routing on trees
    Busch, C
    Magdon-Ismail, M
    Mavronicolas, M
    Wattenhofer, R
    [J]. EURO-PAR 2004 PARALLEL PROCESSING, PROCEEDINGS, 2004, 3149 : 820 - 827
  • [9] Near-optimal bounded-degree spanning trees
    Hansen, JC
    Schmutz, E
    [J]. ALGORITHMICA, 2001, 29 (1-2) : 148 - 180
  • [10] On the Irregularity of π-Permutation Graphs, Fibonacci Cubes, and Trees
    Alizadeh, Yaser
    Deutsch, Emeric
    Klavzar, Sandi
    [J]. BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2020, 43 (06) : 4443 - 4456
12345