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.68710MaRDI QIDQ1351353
Narsingh Deo, Bruce Boldon, Nishit Kumar
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
68R10: Graph theory (including graph drawing) in computer science
68M99: Computer system organization
Related Items
Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs., A multiperiod degree constrained minimal spanning tree problem, Using Lagrangian dual information to generate degree constrained spanning trees
Uses Software