✦ LIBER ✦

Algorithms for updating minimal spanning trees

✍ Scribed by Francis Chin; David Houck

Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 641 KB
Volume: 16
Category: Article
ISSN: 0022-0000
DOI: 10.1016/0022-0000(78)90022-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimal spanning trees: An empirical inv

Minimal spanning trees: An empirical investigation of parallel algorithms

✍ R.S Barr; R.V Helgaon; J.L Kennington 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 440 KB

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

Minimal spanning trees and partial sorti

Minimal spanning trees and partial sorting

✍ J.J. Brennan 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 412 KB

An alternative for the implementation of

An alternative for the implementation of Kruskal's minimal spanning tree algorithm

✍ Jyrki Katajainen; Olli Nevalainen 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 784 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 ⌫,