scientific article; zbMATH DE number 1086911
From MaRDI portal
Publication:4363166
zbMath0878.90100MaRDI QIDQ4363166
Publication date: 5 January 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
minimum spanning treecapacitateddegree-constrainedconstrained spanning treemassively-parallel SIMD machinesmaximum-leafoptimum-communication
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Parallel numerical computation (65Y05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (4)
Memory-efficient enumeration of constrained spanning trees ⋮ Two new algorithms for UMTS access network topology design ⋮ The \((K, k)\)-capacitated spanning tree problem ⋮ A unifying model for locally constrained spanning tree problems
Uses Software
This page was built for publication:
