✦ LIBER ✦

Minimal spanning trees and partial sorting

✍ Scribed by J.J. Brennan

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 412 KB
Volume: 1
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(82)90010-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimal ratio spanning trees

✍ R. Chandrasekaran 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 323 KB

Computing capacitated minimal spanning t

Computing capacitated minimal spanning trees efficiently

✍ A. Kershenbaum 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 645 KB

Algorithms for updating minimal spanning

Algorithms for updating minimal spanning trees

✍ Francis Chin; David Houck 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 641 KB

Uniform and minimal essential spanning f

Uniform and minimal essential spanning forests on trees

✍ Olle Häggström 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 252 KB

Uniform and minimal random spanning trees for finite graphs are well-known objects. Analogues of these for the nearest-neighbor graph on Z d have been studied by Pemantle and Alexander. Here we propose analogous definitions of uniform resp. minimal essential spanning forests for an infinite tree ⌫,

On minimal cost-reliability ratio spanni

On minimal cost-reliability ratio spanning trees and related problems

✍ Yung-Cheng Chang; Lih-Hsing Hsu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 344 KB

Connected graphs with a minimal number o

Connected graphs with a minimal number of spanning trees

✍ N Gaffke 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 743 KB