Williamson, Matthew; Subramani, K. - In: Computational Optimization and Applications 61 (2015) 1, pp. 189-204
<Para ID="Par1">This paper proposes a new algorithm for the minimum spanning tree verification (MSTV) problem in undirected graphs. The MSTV problem is distinct from the minimum spanning tree construction problem. The above problems have been studied extensively, and there exist several papers in the literature...</para>
