Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine
From MaRDI portal
Publication:1351353
DOI10.1016/0167-8191(95)00010-0zbMath0875.68710OpenAlexW2014340938MaRDI QIDQ1351353
Bruce Boldon, Nishit Kumar, Narsingh Deo
Publication date: 27 February 1997
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8191(95)00010-0
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68M99)
Related Items (6)
Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs. ⋮ A computational study on the maximum-weight bounded-degree rooted tree problem ⋮ Using Lagrangian dual information to generate degree constrained spanning trees ⋮ Exact algorithms for finding constrained minimum spanning trees ⋮ Design of capacitated degree constrained min-sum arborescence ⋮ A multiperiod degree constrained minimal spanning tree problem
Uses Software
This page was built for publication: Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine
