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 条
  • [31] On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph
    Frieze, Alan
    Johansson, Tony
    COMBINATORICS PROBABILITY & COMPUTING, 2018, 27 (02): : 228 - 244
  • [32] Extremal graphs for a spectral inequality on edge-disjoint spanning trees
    University of Delaware, Newark
    DE
    19716, United States
    不详
    MD
    20878, United States
    不详
    MA
    02139, United States
    arXiv, 1600,
  • [33] Constructing edge-disjoint spanning trees in locally twisted cubes
    Hsieh, Sun-Yuan
    Tu, Chang-Jen
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (8-10) : 926 - 932
  • [34] Edge-disjoint spanning trees for the generalized butterfly networks and their applications
    Touzene, A
    Day, K
    Monien, B
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2005, 65 (11) : 1384 - 1396
  • [35] Extremal Graphs for a Spectral Inequality on Edge-Disjoint Spanning Trees
    Cioaba, Sebastian M.
    Ostuni, Anthony
    Park, Davin
    Potluri, Sriya
    Wakhare, Tanay
    Wong, Wiseley
    ELECTRONIC JOURNAL OF COMBINATORICS, 2022, 29 (02):
  • [36] Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
    Lin, Jia-Cian
    Yang, Jinn-Shyong
    Hsu, Chiun-Chieh
    Chang, Jou-Ming
    INFORMATION PROCESSING LETTERS, 2010, 110 (10) : 414 - 419
  • [37] Finding edge-disjoint paths in partial k-trees
    Zhou, X
    Tamura, S
    Nishizeki, T
    ALGORITHMICA, 2000, 26 (01) : 3 - 30
  • [38] Edge-disjoint spanning trees and the number of maximum state circles of a graph
    Xiaoli Ma
    Baoyindureng Wu
    Xian’an Jin
    Journal of Combinatorial Optimization, 2018, 35 : 997 - 1008
  • [39] Finding edge-disjoint paths in partial k-trees
    Zhou, XA
    Tamura, S
    Nishizeki, T
    ALGORITHMS AND COMPUTATION, 1996, 1178 : 203 - 212
  • [40] Edge-disjoint spanning trees on the star network with applications to fault tolerance
    Fragopoulou, P
    Akl, SG
    IEEE TRANSACTIONS ON COMPUTERS, 1996, 45 (02) : 174 - 185
12345