Computation of constrained spanning trees: A unified approach

MaRDI QIDQ4363166zbMATH OpenFDO

Authors Narsingh Deo, Nishit Kumar

Publication date 5 January 1998

zbMATH Keywords

capacitatedconstrained spanning treedegree-constrainedmassively-parallel SIMD machinesmaximum-leafminimum spanning treeoptimum-communication

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 1163716
• scientific article; zbMATH DE number 1161326
• Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine

Cited in

(10)

• Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine
• The \((K, k)\)-capacitated spanning tree problem
• A unifying model for locally constrained spanning tree problems
• Two new algorithms for UMTS access network topology design
• Using Lagrangian dual information to generate degree constrained spanning trees
• Memory-efficient enumeration of constrained spanning trees
• The Weighted Spanning Tree Constraint Revisited
• Enumerating Constrained Non-crossing Geometric Spanning Trees
• Generation of colour-constrained spanning trees with application in symbolic circuit analysis
• scientific article; zbMATH DE number 1163716 (Why is no real title available?)

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: Computation of constrained spanning trees: A unified approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4363166)