𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On finding most uniform spanning trees

✍ Scribed by Zvi Galil; Baruch Schieber

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
243 KB
Volume
20
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Most and least uniform spanning trees
Most and least uniform spanning trees
✍ Paolo M. Camerini; Francesco Maffioli; Silvano Martello; Paolo Toth πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 708 KB
Finding theksmallest spanning trees
Finding theksmallest spanning trees
✍ David Eppstein πŸ“‚ Article πŸ“… 1992 πŸ› Springer Netherlands 🌐 English βš– 763 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 ⌫,