𝔖 Bobbio Scriptorium
✦   LIBER   ✦

B-tree with fixed node size and no minimum degree

✍ Scribed by Prakash, Chandra

Book ID
107343220
Publisher
Springer
Year
2007
Tongue
English
Weight
986 KB
Volume
3
Category
Article
ISSN
1772-9890

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Models and heuristics for the k -degree
Models and heuristics for the k -degree constrained minimum spanning tree problem with node-degree costs
✍ Christophe Duhamel; Luís Gouveia; Pedro Moura; Maurício de Souza 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 319 KB 👁 1 views

## Abstract The __k__ ‐Degree constrained Minimum Spanning Tree Problem (__k__ ‐DMSTP) consists in finding a minimal cost spanning tree satisfying the condition that every node has a degree no greater than a fixed value __k__. Here we consider an extension where besides the edge costs, a concave co