✦ LIBER ✦

Finding minimal spanning trees in a euclidean coordinate space

✍ Scribed by O. Nevalainen; J. Ernvall; J. Katajainen

Publisher: Springer Netherlands
Year: 1981
Tongue: English
Weight: 420 KB
Volume: 21
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01934070

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A divisive scheme for constructing minim

A divisive scheme for constructing minimal spanning trees in coordinate space

✍ Sabyasachy Choudhury; M.Narasimha Murty 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 322 KB

On the worst case of a minimal spanning

On the worst case of a minimal spanning tree algorithm for euclidean space

✍ Jyrki Katajainen 📂 Article 📅 1983 🏛 Springer Netherlands 🌐 English ⚖ 385 KB

Two-dimensional minimal surfaces in a ps

Two-dimensional minimal surfaces in a pseudo-Euclidean space

✍ V. P. Gorokh 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 670 KB

Finding minimal cut sets in a fault tree

✍ Jørn Vatn 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 234 KB

This paper presents a new method for identification of minimal cut sets in a fault tree. The (non-minimal) cut sets are found by a modification of the well-known MOCUS algorithm. These cut sets are stored in a virtual tree structure which requires far less core space than the MOCUS cut set matrix. T

The stability of a minimal surface in a

The stability of a minimal surface in a pseudo-Euclidean space

✍ V. P. Gorokh 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 250 KB

The NP-completeness of finding A-trails

The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs

✍ Lars Døvling Andersen; Herbert Fleischner 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 821 KB