SOLVING SOME GRAPH PROBLEMS WITH OPTIMAL OR NEAR-OPTIMAL SPEEDUP ON MESH-OF-TREES NETWORKS.

被引:0
|
作者
Huang, Ming-Deh A. [1 ]
机构
[1] IBM, Thomas J. Watson Research Cent, USA, IBM, Thomas J. Watson Research Cent, USA
关键词
Compilation and indexing terms; Copyright 2025 Elsevier Inc;
D O I
10.1109/sfcs.1985.52
中图分类号
学科分类号
摘要
COMPUTER SYSTEMS, DIGITAL - Parallel Processing
引用
收藏
页码:232 / 240
相关论文
共 50 条
  • [21] Search trees with relaxed balance and near-optimal height
    Fagerberg, R
    Jensen, RE
    Larsen, KS
    ALGORITHMS AND DATA STRUCTURES, 2001, 2125 : 414 - 425
  • [22] Near-optimal bounded-degree spanning trees
    J. C. Hansen
    E. Schmutz
    Algorithmica, 2001, 29 : 148 - 180
  • [23] Near-optimal control for stochastic recursive problems
    Hui, Eddie
    Huang, Jianhui
    Li, Xun
    Wang, Guangchen
    SYSTEMS & CONTROL LETTERS, 2011, 60 (03) : 161 - 168
  • [24] Near-optimal allocation of delay requirements on multicast trees
    Tran, HT
    Harris, RJ
    CONVERGED NETWORKING: DATA AND REAL-TIME COMMUNICATIONS OVER IP, 2003, 119 : 325 - 339
  • [25] Near-optimal hot-potato routing on trees
    Busch, C
    Magdon-Ismail, M
    Mavronicolas, M
    Wattenhofer, R
    EURO-PAR 2004 PARALLEL PROCESSING, PROCEEDINGS, 2004, 3149 : 820 - 827
  • [26] Near-optimal bounded-degree spanning trees
    Hansen, JC
    Schmutz, E
    ALGORITHMICA, 2001, 29 (1-2) : 148 - 180
  • [27] Near-Optimal Quantum Algorithms for String Problems
    Akmal, Shyan
    Jin, Ce
    ALGORITHMICA, 2023, 85 (08) : 2260 - 2317
  • [28] Near-Optimal Quantum Algorithms for String Problems
    Akmal, Shyan
    Jin, Ce
    PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 2791 - 2832
  • [29] Near-Optimal Quantum Algorithms for String Problems
    Shyan Akmal
    Ce Jin
    Algorithmica, 2023, 85 : 2260 - 2317
  • [30] Near-Optimal Graph Signal Sampling by Pareto Optimization
    Luo, Dongqi
    Si, Binqiang
    Zhang, Saite
    Yu, Fan
    Zhu, Jihong
    SENSORS, 2021, 21 (04) : 1 - 13