arrow
返回

Dynamically Reconstructing Minimum Spanning Trees After Swapping Pairwise Vertices

delete2019-01-01
delete4
delete
OA
AI
Z
Zhang-Hua Fu
S
Sibo Chen
Y
Yi-Fei Ming
陈
陈永泉 (Yong Q. Chen)
X
Xiang-Jing Lai *
DOI:10.1109/ACCESS.2019.2894829delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
The minimum spanning tree (MST) problem is a fundamental problem in computer science and operations research, which has many real-life network design applications. Given a graph G with n vertices and m edges, starting from an MST (denoted by T) covering a subgraph of G, it is usually needed to reconstruct a new MST after swapping two vertices v is an element of T and v' is not an element of T. For this purpose, the most popular choice is to reconstruct an MST from scratch, for which the current fastest algorithm (Kruskal's algorithm based on Fibonacci heap) requires a time complexity of O(m + n . log n), implying that a high time complexity of O(n(2)) . O(m + n . log n) is needed to evaluate all the O(n(2)) possible swapping-based moves. In order to evaluate these moves more efficiently, we integrate a series of dynamic techniques to develop a fast dynamic swap-vertex move operator, which significantly reduces the overall time complexity from O(n(2)) . O(m + n . log n) to O(n) . O(m . log n). We also strictly prove the correctness of the introduced method. Finally, we choose three well-studied Steiner/spanning tree problems as our test bed and carry out extensive experiments on 140 representative instances to show the effectiveness and efficiency of the proposed method. More importantly, as a general-purpose method, the dynamic swap-vertex move operator could be easily adapted to many other tree-related problems.
Keyword:
Dynamic data structure
Steiner/spanning tree problems
swap-vertex move operator
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Access 封面图
IEEE Access
IF:
3.6
论文数:
9.8W
被引数:
29.4W

机构

T
The Chinese University of Hong Kong, Shenzhen
学者数:
4.3K
论文数: 4.0K
被引数: 7
引用论文

引用论文

Optical spectroscopy and crystal-field analysis of U3+: Ba2YCl7
err2002-01-01
err0
PREAI
errMirosław Karbowiak; Agnieszka Mech; Janusz Drożdżyński; Zbigniew Gajek; Norman M. Edelstein
err分享
err收藏
Induced Innovation and Energy Prices
err
IF0
err2001-05-01
err0
errOAAI
errDavid Popp
err分享
err收藏
Distributed Sub-Tree-Based Optical Multicasting Scheme in Elastic Optical Data Center Networks
err2018-01-01
err26
errOAAI
errLi, Xin; Zhang, Lu; Tang, Ying; Guo, Junfeng; Huang, Shanguo
err分享
err收藏
学者 查看更多内容