Weighted scheduling algorithm with o(N2) complexity for input-buffered queue

被引：0
|
作者：
Sun, Zhi-Gang
Su, Jin-Shu
Lu, Xi-Cheng
机构：
来源：
Jisuanji Yanjiu yu Fazhan/Computer Research and Development | 2002年 / 39卷 / 05期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [41] An O(n2 log n) algorithm for the weighted stable set problem in claw-free graphs
    Nobili, Paolo
    Sassano, Antonio
    MATHEMATICAL PROGRAMMING, 2021, 186 (1-2) : 409 - 437
  • [42] An O(n2) algorithm to color Meyniel graphs
    Roussel, F
    Rusu, I
    DISCRETE MATHEMATICS, 2001, 235 (1-3) : 107 - 123
  • [43] A NEW O(N2) SHORTEST CHAIN ALGORITHM
    WAISSI, GR
    APPLIED MATHEMATICS AND COMPUTATION, 1990, 37 (02) : 111 - 120
  • [44] AN O(N2) ALGORITHM FOR UNDIRECTED SPLIT DECOMPOSITION
    MA, TH
    SPINRAD, J
    JOURNAL OF ALGORITHMS, 1994, 16 (01) : 145 - 160
  • [45] Fast scheduling algorithm for input and output buffered ATM switch with multiple switching planes
    Han, MS
    Lee, JH
    Lee, BC
    ELECTRONICS LETTERS, 1999, 35 (23) : 1999 - 2000
  • [46] An O(N2) Algorithm for Computation of the Minimum Time Consensus
    Mulla, Ameer K.
    Patil, Deepak U.
    Chakraborty, Debraj
    2016 IEEE 55TH CONFERENCE ON DECISION AND CONTROL (CDC), 2016, : 2638 - 2643
  • [47] Weighted fair scheduling algorithm for QoS of input-queued switches
    Lee, SH
    Shin, DR
    Youn, HY
    NETWORK AND PARALLEL COMPUTING, PROCEEDINGS, 2004, 3222 : 366 - 373
  • [48] An O(n2) parallel algorithm for the maximum flow problem
    Tabirca, S
    Tabirca, T
    Concurrent Information Processing and Computing, 2005, 195 : 294 - 300
  • [49] AN O(N2) ALGORITHM FOR COLORING PERFECT PLANAR GRAPHS
    TUCKER, A
    WILSON, D
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1984, 5 (01): : 60 - 68
  • [50] Low-Complexity Scheduling Algorithm for Sum-Queue Minimization in Wireless Convergecast
    Venkataramanan, V. J.
    Lin, Xiaojun
    2011 PROCEEDINGS IEEE INFOCOM, 2011, : 2336 - 2344
12345