Presents an O(m+n) algorithm for finding all minimum spanning tree replacement edges when the MST and sorted non-tree edges are given.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges
Presents an O(m+n) algorithm for finding all minimum spanning tree replacement edges when the MST and sorted non-tree edges are given.