On edge-disjoint spanning trees with small depths

被引：8
|
作者：
Hasunuma, T [1 ]
机构：
[1] Univ Electrocommun, Dept Comp Sci, Tokyo 1828585, Japan
来源：
INFORMATION PROCESSING LETTERS | 2000年 / 75卷 / 1-2期
关键词：
edge-disjoint spanning trees; parallel processing; broadcasting; computational complexity; NP-hard;
D O I：
10.1016/S0020-0190(00)00078-8
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Let G be a graph with n vertices. Suppose that there are k edge-disjoint spanning trees in G. We show that if the minimum degree of the vertices in G is at least kl, then there are k edge-disjoint spanning trees rooted at any vertex with depth O(n/l) in G. Also, we show that given a graph, a vertex r of the graph, and a positive integer k, the problem of finding k edge-disjoint spanning trees rooted at r with optimal depth is NP-hard. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：71 / 74
页数：4
相关论文
共 50 条
  • [41] Edge-Disjoint Steiner Trees and Connectors in Graphs
    Li, Hengzhe
    Liu, Huayue
    Liu, Jianbing
    Mao, Yaping
    [J]. GRAPHS AND COMBINATORICS, 2023, 39 (02)
  • [42] Three Edge-Disjoint Plane Spanning Paths in a Point Set
    Kindermann, P.
    Kratochvil, J.
    Liotta, G.
    Valtr, P.
    [J]. GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2023, PT I, 2023, 14465 : 323 - 338
  • [43] A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs
    Gu, Xiaofeng
    Lai, Hong-Jian
    [J]. DISCRETE MATHEMATICS, 2018, 341 (02) : 400 - 404
  • [44] The maximum edge-disjoint paths problem in bidirected trees
    Erlebach, T
    Jansen, K
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2001, 14 (03) : 326 - 355
  • [45] RANDOMIZED PARALLEL ALGORITHMS FOR MATROID UNION AND INTERSECTION, WITH APPLICATIONS TO ARBORESENCES AND EDGE-DISJOINT SPANNING-TREES
    NARAYANAN, H
    SARAN, H
    VAZIRANI, VV
    [J]. SIAM JOURNAL ON COMPUTING, 1994, 23 (02) : 387 - 397
  • [46] Finding Edge-Disjoint Paths in Partial k -Trees
    X. Zhou
    S. Tamura
    T. Nishizeki
    [J]. Algorithmica, 2000, 26 : 3 - 30
  • [47] Minimum degree and minimum number of edge-disjoint trees
    Lladó, A
    Lopez, SC
    [J]. DISCRETE MATHEMATICS, 2004, 275 (1-3) : 195 - 205
  • [48] 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
    [J]. Automation and Remote Control, 2023, 84 : 772 - 787
  • [49] Anti-Ramsey Problems in Complete Bipartite Graphs for t Edge-Disjoint Rainbow Spanning Trees
    Jia, Yuxing
    Lu, Mei
    Zhang, Yi
    [J]. GRAPHS AND COMBINATORICS, 2021, 37 (02) : 409 - 433
  • [50] Anti-Ramsey Problems in Complete Bipartite Graphs for t Edge-Disjoint Rainbow Spanning Trees
    Yuxing Jia
    Mei Lu
    Yi Zhang
    [J]. Graphs and Combinatorics, 2021, 37 : 409 - 433
12345