IEEE

Parallel algorithms for the degree-constrained minimum spanning tree problem using nearest-neighbor chains and the heap-traversal technique

Abstract: The degree-constrained minimum spanning tree (d-MST) problem attempts to find a minimum spanning tree with an added constraint that no nodes in the tree have a degree larger than a specified ...
IEEE

Efficient minimum spanning tree construction without Delaunay triangulation [VLSI CAD]

Abstract: Minimum spanning tree problem is a very important problem in VLSI CAD. Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum ...
JSTOR Daily

A survey of different integer programming formulations of the generalized minimum spanning tree problem

Carpathian Journal of Mathematics, Vol. 25, No. 1 (2009), pp. 104-118 (15 pages) In this survey paper, we discuss the development of the Generalized Minimum Spanning Tree Problem, denoted by GMSTP, ...
GitHub

Minimum Spanning Tree Solver

Minimum Spanning Tree Solver is a C++ project that solves the MST problem using a linear programming formulation via IBM CPLEX and visualizes results using CDT (Conforming Delaunay Triangulation).
JSTOR Daily

APPROXIMATION RESULTS FOR THE GENERALIZED MINIMUM SPANNING TREE PROBLEM

Buletinul ştiinţific al Universitatii Baia Mare, Seria B, Fascicola matematică-informatică, Vol. 18, No. 1 (2002), pp. 95-104 (10 pages) We consider the Generalized Minimum Spanning Tree problem ...