ALGORITHMS FOR UPDATING MINIMAL SPANNING TREES

被引:62
|
作者
CHIN, F [1 ]
HOUCK, D [1 ]
机构
[1] UNIV MARYLAND,DEPT MATH,CATONSVILLE,MD 21228
关键词
D O I
10.1016/0022-0000(78)90022-3
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:333 / 344
页数:12
相关论文
共 50 条
  • [41] Distributed Memory Parallel Algorithms for Minimum Spanning Trees
    Loncar, Vladmir
    Skrbic, Srdjan
    Balaz, Antun
    WORLD CONGRESS ON ENGINEERING - WCE 2013, VOL II, 2013, : 1271 - +
  • [42] Packing algorithms for arborescences (and spanning trees) in capacitated graphs
    Gabow, HN
    Manu, KS
    MATHEMATICAL PROGRAMMING, 1998, 82 (1-2) : 83 - 109
  • [43] Exact algorithms for finding constrained minimum spanning trees
    Yao, Pei
    Guo, Longkun
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (03) : 2085 - 2103
  • [44] Packing algorithms for arborescences (and spanning trees) in capacitated graphs
    Harold N. Gabow
    K. S. Manu
    Mathematical Programming, 1998, 82 : 83 - 109
  • [45] Exact algorithms for finding constrained minimum spanning trees
    Pei Yao
    Longkun Guo
    Journal of Combinatorial Optimization, 2022, 44 : 2085 - 2103
  • [46] MINIMAL GRAPHS FOR COMPLETELY INDEPENDENT SPANNING TREES AND COMPLETELY INDEPENDENT SPANNING TREES IN COMPLETE T-PARTITE GRAPH
    Hong, Xia
    Gao, Feng
    Wu, Zengbao
    CONTRIBUTIONS TO DISCRETE MATHEMATICS, 2024, 19 (02) : 23 - 35
  • [47] The central limit theorem for Euclidean minimal spanning trees II
    Lee, S
    ADVANCES IN APPLIED PROBABILITY, 1999, 31 (04) : 969 - 984
  • [48] Constructing minimal spanning/Steiner trees with bounded path length
    Univ of Southern California, Los Angeles, United States
    Integr VLSI J, 1-2 (137-163):
  • [49] Optimal path and minimal spanning trees in random weighted networks
    Braunstein, Lidia A.
    Wu, Zhenhua
    Chen, Yiping
    Buldyrev, Sergey V.
    Kalisky, Tomer
    Sreenivasan, Sameet
    Cohen, Reuven
    Lopez, Eduardo
    Havlin, Shlomo
    Stanley, H. Eugene
    INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS, 2007, 17 (07): : 2215 - 2255
  • [50] Minimal cost spanning trees for nearest-neighbour matching
    Chua, J
    Tischer, P
    COMPUTATIONAL INTELLIGENCE FOR MODELLING, CONTROL & AUTOMATION - INTELLIGENT IMAGE PROCESSING, DATA ANALYSIS & INFORMATION RETRIEVAL, 1999, 56 : 7 - 12