A NOTE ON FINDING MINIMUM-COST EDGE-DISJOINT SPANNING-TREES

被引:75
|
作者
ROSKIND, J
TARJAN, RE
机构
[1] AT&T BELL LABS,MURRAY HILL,NJ 07974
[2] MIT,CAMBRIDGE,MA 02139
关键词
EDGE-DISJOINT FORESTS - NETWORKS - SPANNING TREES;
D O I
10.1287/moor.10.4.701
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:701 / 708
页数:8
相关论文
共 50 条
  • [41] Edge-disjoint spanning trees and the number of maximum state circles of a graph
    Ma, Xiaoli
    Wu, Baoyindureng
    Jin, Xian'an
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018, 35 (04) : 997 - 1008
  • [42] ANTI-RAMSEY NUMBER OF EDGE-DISJOINT RAINBOW SPANNING TREES
    Lu, Linyuan
    Wang, Zhiyu
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020, 34 (04) : 2346 - 2362
  • [43] Edge-disjoint node-independent spanning trees in dense Gaussian networks
    AlBdaiwi, Bader
    Hussain, Zaid
    Cerny, Anton
    Aldred, Robert
    JOURNAL OF SUPERCOMPUTING, 2016, 72 (12): : 4718 - 4736
  • [44] MINIMUM-COST SPANNING TREE AS A PATH-FINDING PROBLEM
    MAGGS, BM
    PLOTKIN, SA
    INFORMATION PROCESSING LETTERS, 1988, 26 (06) : 291 - 293
  • [45] Edge-disjoint node-independent spanning trees in dense Gaussian networks
    Bader AlBdaiwi
    Zaid Hussain
    Anton Cerny
    Robert Aldred
    The Journal of Supercomputing, 2016, 72 : 4718 - 4736
  • [46] A Discharging Method to Find Subgraphs Having Two Edge-disjoint Spanning Trees
    Wang, Keke
    Zhan, Mingquan
    Lai, Hong-Jian
    ARS COMBINATORIA, 2019, 144 : 187 - 193
  • [47] FINDING THE K SMALLEST SPANNING-TREES
    EPPSTEIN, D
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 447 : 38 - 47
  • [48] ON FINDING MOST UNIFORM SPANNING-TREES
    GALIL, Z
    SCHIEBER, B
    DISCRETE APPLIED MATHEMATICS, 1988, 20 (02) : 173 - 175
  • [49] Edge-disjoint placement of three trees
    Maheo, M
    Sacle, JF
    Wozniak, M
    EUROPEAN JOURNAL OF COMBINATORICS, 1996, 17 (06) : 543 - 563
  • [50] Edge-Disjoint Fibonacci Trees in Hypercube
    Raman, Indhumathi
    Kuppusamy, Lakshmanan
    JOURNAL OF COMPUTER NETWORKS AND COMMUNICATIONS, 2014, 2014