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
来源：
MATHEMATICS OF OPERATIONS RESEARCH | 1985年 / 10卷 / 04期
关键词：
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 条
  • [21] Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs
    Gu, Xiaofeng
    Lai, Hong-Jian
    Li, Ping
    Yao, Senmei
    JOURNAL OF GRAPH THEORY, 2016, 81 (01) : 16 - 29
  • [22] Edge-disjoint spanning trees and eigenvalues of regular graphs
    Cioaba, Sebastian M.
    Wong, Wiseley
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2012, 437 (02) : 630 - 647
  • [23] Edge-disjoint rainbow spanning trees in complete graphs
    Carraher, James M.
    Hartke, Stephen G.
    Horn, Paul
    EUROPEAN JOURNAL OF COMBINATORICS, 2016, 57 : 71 - 84
  • [24] Edge-disjoint spanning trees in the line graph of hypercubes
    Qian, Yu
    Cheng, Baolei
    Fan, Jianxi
    Wang, Yifeng
    Jiang, Ruofan
    2021 IEEE 32ND INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES AND PROCESSORS (ASAP 2021), 2021, : 61 - 64
  • [25] Constructing edge-disjoint spanning trees in product networks
    Ku, SC
    Wang, BF
    Hung, TK
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2003, 14 (03) : 213 - 221
  • [26] Good orientations of unions of edge-disjoint spanning trees
    Bang-Jensen, Jorgen
    Bessy, Stephane
    Huang, Jing
    Kriesell, Matthias
    JOURNAL OF GRAPH THEORY, 2021, 96 (04) : 594 - 618
  • [27] AN ALGORITHM FOR FINDING K-MINIMUM SPANNING-TREES
    KATOH, N
    IBARAKI, T
    MINE, H
    SIAM JOURNAL ON COMPUTING, 1981, 10 (02) : 247 - 255
  • [28] Finding Edge-Disjoint Paths in Partial k -Trees
    X. Zhou
    S. Tamura
    T. Nishizeki
    Algorithmica, 2000, 26 : 3 - 30
  • [29] EDGE-DISJOINT SPANNING TREES AND DEPTH-FIRST SEARCH
    TARJAN, RE
    ACTA INFORMATICA, 1976, 6 (02) : 171 - 185
  • [30] Building k edge-disjoint spanning trees of minimum total length for isometric data embedding
    Yang, L
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2005, 27 (10) : 1680 - 1683
12345