Real-time emulations of bounded-degree networks

被引：4
|
作者：
Maggs, BM
Schwabe, EJ
机构：
[1] Northwestern Univ, Dept Elect & Comp Engn, Evanston, IL 60208 USA
[2] Carnegie Mellon Univ, Sch Comp Sci, Pittsburgh, PA 15213 USA
来源：
INFORMATION PROCESSING LETTERS | 1998年 / 66卷 / 05期
关键词：
bounded-degree processor networks; real-time and work-preserving emulations; interconnection networks;
D O I：
10.1016/S0020-0190(98)00064-7
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：269 / 276
页数：8
相关论文
共 50 条
  • [31] Euclidean bounded-degree spanning tree ratios
    Chan, TM
    DISCRETE & COMPUTATIONAL GEOMETRY, 2004, 32 (02) : 177 - 194
  • [32] The complexity of approximating bounded-degree Boolean #CSP
    Dyer, Martin
    Goldberg, Leslie Ann
    Jalsenius, Markus
    Richerby, David
    INFORMATION AND COMPUTATION, 2012, 220 : 1 - 14
  • [33] Sparse universal graphs for bounded-degree graphs
    Alon, Noga
    Capalbo, Michael
    RANDOM STRUCTURES & ALGORITHMS, 2007, 31 (02) : 123 - 133
  • [34] A Parameterized Algorithm for Bounded-Degree Vertex Deletion
    Xiao, Mingyu
    COMPUTING AND COMBINATORICS, COCOON 2016, 2016, 9797 : 79 - 91
  • [35] Bounded-degree independent sets in planar graphs
    Biedl, T
    Wilkinson, DF
    THEORY OF COMPUTING SYSTEMS, 2005, 38 (03) : 253 - 278
  • [36] On Bounded-Degree Vertex Deletion parameterized by treewidth
    Betzler, Nadja
    Bredereck, Robert
    Niedermeier, Rolf
    Uhlmann, Johannes
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (1-2) : 53 - 60
  • [37] Bounded-Degree Independent Sets in Planar Graphs
    Therese Biedl
    Dana F. Wilkinson
    Theory of Computing Systems, 2005, 38 : 253 - 278
  • [38] Learning bounded-degree polytrees with known skeleton
    Choo, Davin
    Yang, Joy Qiping
    Bhattacharyya, Arnab
    Canonne, Clement L.
    INTERNATIONAL CONFERENCE ON ALGORITHMIC LEARNING THEORY, VOL 237, 2024, 237
  • [39] Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios
    Biniaz, Ahmad
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 826 - 836
  • [40] Computing bounded-degree phylogenetic roots of disconnected graphs
    Chen, ZZ
    Tsukiji, T
    GRAPH -THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2004, 3353 : 308 - 319
12345