𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reoptimization of the minimum spanning tree

✍ Scribed by Stratos A. Paschos; Vangelis Th. Paschos

Book ID
115563806
Publisher
Wiley (John Wiley & Sons)
Year
2011
Tongue
English
Weight
155 KB
Volume
4
Category
Article
ISSN
0163-1829

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Minimum spanning tree
Minimum spanning tree
✍ Cahit, I.; Cahit, R. πŸ“‚ Article πŸ“… 1975 πŸ› Institution of Electrical Engineers βš– 138 KB
The Capacitated Minimum Spanning Tree
The Capacitated Minimum Spanning Tree
✍ K. M. Chandy; Tachen Lo πŸ“‚ Article πŸ“… 1973 πŸ› John Wiley and Sons 🌐 English βš– 386 KB

## Abstract The capacitated minimum spanning tree is an offspring of the minimum spanning tree and network flow problems. It has application in the design of multipoint linkages in elementary teleprocessing tree networks. Some theorems are used in conjunction with Little's branch and bound algorith

The Stackelberg Minimum Spanning Tree Ga
The Stackelberg Minimum Spanning Tree Game
✍ Jean Cardinal; Erik D. Demaine; Samuel Fiorini; GwenaΓ«l Joret; Stefan Langerman; πŸ“‚ Article πŸ“… 2009 πŸ› Springer 🌐 English βš– 430 KB
The minimum-area spanning tree problem
The minimum-area spanning tree problem
✍ Paz Carmi; Matthew J. Katz; Joseph S.B. Mitchell πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 228 KB