✦ LIBER ✦

Minimum spanning tree

✍ Scribed by Cahit, I.; Cahit, R.

Book ID: 119747364
Publisher: Institution of Electrical Engineers
Year: 1975
Weight: 138 KB
Volume: 122
Category: Article
ISSN: 0020-3270
DOI: 10.1049/piee.1975.0136

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Degree-constrained minimum spanning tree

✍ Subhash C. Narula; Cesar A. Ho 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 868 KB

Minimum cost spanning tree games

✍ Daniel Granot; Gur Huberman 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 651 KB

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

A probabilistic minimum spanning tree al

A probabilistic minimum spanning tree algorithm

✍ F. James Rohlf 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 776 KB

Minimum spanning tree with hop restricti

Minimum spanning tree with hop restrictions

✍ Refael Hassin; Asaf Levin 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 185 KB

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