Dynamically Reconstructing Minimum Spanning Trees After Swapping Pairwise Vertices

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 recon...

पूर्ण विवरण

ग्रंथसूची विवरण

मुख्य लेखकों:	Zhang-Hua Fu, Si-Bo Chen, Yi-Fei Ming, Yong-Quan Chen, Xiang-Jing Lai
स्वरूप:	Artigo
भाषा:	Inglês
प्रकाशित:	IEEE 2019-01-01
श्रृंखला:	IEEE Access
विषय:	Dynamic data structure Steiner/spanning tree problems swap-vertex move operator
ऑनलाइन पहुंच:	https://ieeexplore.ieee.org/document/8624515/
टैग:	टैग जोड़ें कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!