LOOP-FREE THRESHOLD ELEMENT STRUCTURES

被引：0
|
作者：
MOW, CW
FU, KS
机构：
来源：
IEEE TRANSACTIONS ON COMPUTERS | 1969年 / C 18卷 / 03期
关键词：
D O I：
10.1109/T-C.1969.222639
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：257 / +
页数：1
相关论文
共 50 条
  • [31] A novel loop-free IP fast reroute algorithm
    Enyedi, Gabor
    Retvari, Gabor
    Cinkler, Tibor
    DEPENDABLE AND ADAPTABLE NETWORKS AND SERVICES, PROCEEDINGS, 2007, 4606 : 111 - +
  • [32] A path-finding algorithm for loop-free routing
    GarciaLunaAceves, JJ
    Murthy, S
    IEEE-ACM TRANSACTIONS ON NETWORKING, 1997, 5 (01) : 148 - 160
  • [33] A LOOP-FREE ALGORITHM FOR GENERATING THE LINEAR EXTENSIONS OF A POSET
    CANFIELD, ER
    WILLIAMSON, SG
    ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 1995, 12 (01): : 57 - 75
  • [34] Routing optimization for IP networks with loop-free alternates
    Hartmann, Matthias
    Hock, David
    Menth, Michael
    COMPUTER NETWORKS, 2016, 95 : 35 - 50
  • [35] ADDRESSLESS UNITS FOR CARRYING OUT LOOP-FREE COMPUTATIONS
    BLIKLE, A
    JOURNAL OF THE ACM, 1972, 19 (01) : 136 - &
  • [36] THE COMPLEXITY OF THE EQUIVALENCE PROBLEM FOR SIMPLE LOOP-FREE PROGRAMS
    IBARRA, OH
    LEININGER, BS
    SIAM JOURNAL ON COMPUTING, 1982, 11 (01) : 15 - 27
  • [37] LOOP-FREE ALGORITHMS FOR TRAVERSING BINARY-TREES
    FENNER, TI
    LOIZOU, G
    BIT, 1984, 24 (01): : 33 - 44
  • [38] Efficient Loop-Free Rerouting of Multiple SDN Flows
    Basta, Arsany
    Blenk, Andreas
    Dudycz, Szymon
    Ludwig, Arne
    Schmid, Stefan
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2018, 26 (02) : 948 - 961
  • [39] On-demand loop-free routing with link vectors
    Garcia-Luna-Aceves, JJ
    Roy, S
    12TH IEEE INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS - PROCEEDINGS, 2004, : 140 - 150
  • [40] A More Efficient Diffusing Update Algorithm For Loop-Free Routing
    Zhao, Chuanqiang
    Liu, Yuanan
    Liu, Kaiming
    2009 5TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-8, 2009, : 4081 - 4084
12345