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 条
  • [31] A parallel algorithm for minimum spanning tree on GPU
    de Alencar Vasconcellos, Jucele Franca
    Caceres, Edson Norberto
    Mongelli, Henrique
    Song, Siang Wun
    [J]. 2017 INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING WORKSHOPS (SBAC-PADW), 2017, : 67 - 72
  • [32] Clustering Based Minimum Spanning Tree Algorithm
    Saxena, Sakshi
    Verma, Priyanka
    Rajpoot, Dharmveer Singh
    [J]. 2017 TENTH INTERNATIONAL CONFERENCE ON CONTEMPORARY COMPUTING (IC3), 2017, : 360 - 362
  • [33] Minimum spanning tree partitioning algorithm for microaggregation
    Laszlo, M
    Mukherjee, S
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (07) : 902 - 911
  • [34] A simpler minimum spanning tree verification algorithm
    King, V
    [J]. ALGORITHMS AND DATA STRUCTURES, 1995, 955 : 440 - 448
  • [35] A simpler minimum spanning tree verification algorithm
    V. King
    [J]. Algorithmica, 1997, 18 : 263 - 270
  • [36] Image registration with minimum spanning tree algorithm
    Ma, B
    Hero, A
    Gorman, J
    Michel, O
    [J]. 2000 INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, VOL I, PROCEEDINGS, 2000, : 481 - 484
  • [37] A simpler minimum spanning tree verification algorithm
    King, V
    [J]. ALGORITHMICA, 1997, 18 (02) : 263 - 270
  • [38] Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree
    Bilo, Davide
    Guala, Luciano
    Proietti, Guido
    [J]. ALGORITHMICA, 2014, 68 (02) : 337 - 357
  • [39] Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree
    Davide Bilò
    Luciano Gualà
    Guido Proietti
    [J]. Algorithmica, 2014, 68 : 337 - 357
  • [40] Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree
    Bilo, Davide
    Guala, Luciano
    Proietti, Guido
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2010, 2010, 6281 : 138 - +
12345