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 条
  • [1] CONNECTIVITY AND EDGE-DISJOINT SPANNING-TREES
    GUSFIELD, D
    INFORMATION PROCESSING LETTERS, 1983, 16 (02) : 87 - 89
  • [2] EDGE-DISJOINT SPANNING-TREES - A CONNECTEDNESS THEOREM
    FARBER, M
    RICHTER, B
    SHANK, H
    JOURNAL OF GRAPH THEORY, 1985, 9 (03) : 319 - 324
  • [3] Note on edge-disjoint spanning trees and eigenvalues
    Liu, Qinghai
    Hong, Yanmei
    Gu, Xiaofeng
    Lai, Hong-Jian
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2014, 458 : 128 - 133
  • [4] Edge-disjoint spanning trees and eigenvalues
    Liu, Qinghai
    Hong, Yanmei
    Lai, Hong-Jian
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2014, 444 : 146 - 151
  • [5] A property on edge-disjoint spanning trees
    Lai, HJ
    Lai, HY
    Payan, C
    EUROPEAN JOURNAL OF COMBINATORICS, 1996, 17 (05) : 447 - 450
  • [6] On edge-disjoint spanning trees in hypercubes
    Barden, B
    Libeskind-Hadas, R
    Davis, J
    Williams, W
    INFORMATION PROCESSING LETTERS, 1999, 70 (01) : 13 - 16
  • [7] On edge-disjoint spanning trees in hypercubes
    Department of Computer Science, Harvey Mudd College, 301 E. 12th Street, Claremont, CA 91711, United States
    Inf. Process. Lett., 1 (13-16):
  • [8] On Asymptotically Optimal Approach for Finding of the Minimum Total Weight of Edge-Disjoint Spanning Trees with a Given Diameter
    Gimadi, E. Kh.
    Shtepa, A. A.
    AUTOMATION AND REMOTE CONTROL, 2023, 84 (07) : 772 - 787
  • [9] On Asymptotically Optimal Approach for Finding of the Minimum Total Weight of Edge-Disjoint Spanning Trees with a Given Diameter
    E. Kh. Gimadi
    A. A. Shtepa
    Automation and Remote Control, 2023, 84 : 772 - 787
  • [10] Edge-connectivity and edge-disjoint spanning trees
    Catlin, Paul A.
    Lai, Hong-Jian
    Shao, Yehong
    DISCRETE MATHEMATICS, 2009, 309 (05) : 1033 - 1040
12345