The vertex degrees of minimum spanning trees

被引:7
|
作者
Cieslik, D [1 ]
机构
[1] Univ Greifswald, Inst Math & Comp Sci, D-17487 Greifswald, Germany
关键词
graph theory; minimum spanning trees;
D O I
10.1016/S0377-2217(99)00458-0
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We study the problem of minimum spanning trees (MST) with degree constraints. It is well-known that this problem in general is, NP-hard. It will be shown that in finite-dimensional Banach spaces there is a number such that a bounded degree MST can be computed as efficiently as an ordinary MST if the degree constraint is greater than this number. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:278 / 282
页数:5
相关论文
共 50 条
  • [21] Distributed verification of minimum spanning trees
    Korman, Amos
    Kutten, Shay
    DISTRIBUTED COMPUTING, 2007, 20 (04) : 253 - 266
  • [22] Minimum Spanning Trees in Temporal Graphs
    Huang, Silu
    Fu, Ada Wai-Chee
    Liu, Ruifeng
    SIGMOD'15: PROCEEDINGS OF THE 2015 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2015, : 419 - 430
  • [23] Planar bichromatic minimum spanning trees
    Borgelt, Magdalene G.
    van Kreveld, Marc
    Loffler, Maarten
    Luo, Jun
    Merrick, Damian
    Silveira, Rodrigo I.
    Vahedi, Mostafa
    JOURNAL OF DISCRETE ALGORITHMS, 2009, 7 (04) : 469 - 478
  • [24] Increasing the weight of minimum spanning trees
    Frederickson, GN
    Solis-Oba, R
    JOURNAL OF ALGORITHMS, 1999, 33 (02) : 244 - 266
  • [25] Minimum spanning trees and types of dissimilarities
    Leclerc, B
    EUROPEAN JOURNAL OF COMBINATORICS, 1996, 17 (2-3) : 255 - 264
  • [26] Galactic Archaeology and Minimum Spanning Trees
    MacFarlane, Ben A.
    Gibson, Brad K.
    Flynn, Chris M. L.
    MULTI-OBJECT SPECTROSCOPY IN THE NEXT DECADE: BIG QUESTIONS, LARGE SURVEYS, AND WIDE FIELDS, 2016, 507 : 79 - 83
  • [27] Finding minimum congestion spanning trees
    Werneck, RFF
    Setubal, JC
    da Conceiçao, AF
    ALGORITHM ENGINEERING, 1999, 1668 : 60 - 71
  • [28] Parametric and kinetic minimum spanning trees
    Agarwal, PK
    Eppstein, D
    Guibas, LJ
    Henzinger, MR
    39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 596 - 605
  • [29] Minimum spanning trees for community detection
    Wu, Jianshe
    Li, Xiaoxiao
    Jiao, Licheng
    Wang, Xiaohua
    Sun, Bo
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2013, 392 (09) : 2265 - 2277
  • [30] Minimum restricted diameter spanning trees
    Hassin, R
    Levin, A
    APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2002, 2462 : 175 - 184