A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges

被引：0
|
作者：
Bader, David A. [1 ]
Burkhardt, Paul [2 ]
机构：
[1] Department of Data Science, New Jersey Institute of Technology, Newark,NJ,07102, United States
[2] National Security Agency, Fort Meade, MD,20755, United States
来源：
Journal of Graph Algorithms and Applications | 2022年 / 26卷 / 04期
基金：
美国国家科学基金会;
关键词：
Clustering algorithms - Undirected graphs;
D O I：
10.7155/JGAA.00609
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：577 / 588
相关论文
共 50 条
  • [1] A distributed algorithm for finding all best swap edges of a minimum diameter spanning tree
    Gfeller, Beat
    Santoro, Nicola
    Widmayer, Peter
    [J]. DISTRIBUTED COMPUTING, PROCEEDINGS, 2007, 4731 : 268 - +
  • [2] Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem
    Bazgan, Cristina
    Toubaline, Sonia
    Vanderpooten, Daniel
    [J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS, 2011, 6831 : 126 - 140
  • [3] An Efficient Minimum Spanning Tree Algorithm
    Abdullah-Al Mamun
    Rajasekaran, Sanguthevar
    [J]. 2016 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATION (ISCC), 2016, : 1047 - 1052
  • [4] A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree
    Gfeller, Beat
    Santoro, Nicola
    Widmayer, Peter
    [J]. IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2011, 8 (01) : 1 - 12
  • [5] Finding the k most vital edges with respect to minimum spanning tree
    Shen, H
    [J]. PROCEEDINGS OF THE IEEE 1997 AEROSPACE AND ELECTRONICS CONFERENCE - NAECON 1997, VOLS 1 AND 2, 1997, : 255 - 262
  • [6] Finding the k most vital edges with respect to minimum spanning tree
    Shen, H
    [J]. ACTA INFORMATICA, 1999, 36 (05) : 405 - 424
  • [7] Finding the k most vital edges with respect to minimum spanning tree
    Hong Shen
    [J]. Acta Informatica, 1999, 36 : 405 - 424
  • [8] Finding the k most vital edges in the minimum spanning tree problem
    Liang, WF
    Shen, XJ
    [J]. PARALLEL COMPUTING, 1997, 23 (13) : 1889 - 1907
  • [9] A new efficient parallel algorithm for minimum spanning tree
    de Alencar Vasconcellos, Jucele Franca
    Caceres, Edson Norberto
    Mongelli, Henrique
    Song, Siang Wun
    [J]. 2018 30TH INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING (SBAC-PAD 2018), 2018, : 107 - 114
  • [10] Efficient determination of the k most vital edges for the minimum spanning tree problem
    Bazgan, Cristina
    Toubaline, Sonia
    Vanderpooten, Daniel
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (11) : 2888 - 2898
12345