✦ LIBER ✦

The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees

✍ Scribed by Supowit, Kenneth J.

Book ID: 121868724
Publisher: Association for Computing Machinery
Year: 1983
Tongue: English
Weight: 897 KB
Volume: 30
Category: Article
ISSN: 0004-5411
DOI: 10.1145/2402.322386

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Listing all the minimum spanning trees i

Listing all the minimum spanning trees in an undirected graph

✍ Yamada, Takeo; Kataoka, Seiji; Watanabe, Kohtaro 📂 Article 📅 2010 🏛 Taylor and Francis Group 🌐 English ⚖ 285 KB

Finding the most vital edge with respect

Finding the most vital edge with respect to minimum spanning tree in weighted graphs

✍ Lih-Hsing Hsu; Rong-Hong Jan; Yu-Che Lee; Chun-Nan Hung; Maw-Sheng Chern 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 557 KB

State space partition algorithms for sto

State space partition algorithms for stochastic systems with applications to minimum spanning trees

✍ Alexopoulos, Christos; Jacobson, Jay A. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB 👁 2 views

We investigated state space partition methods for computing probability measures related to the operation of stochastic systems and present new theoretical results concerning their efficiency. These methods iteratively partition the system state space, producing at each step progressively tighter bo

An adaptive heuristic to the bounded-dia

An adaptive heuristic to the bounded-diameter minimum spanning tree problem

✍ Akbari Torkestani, Javad 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 833 KB

Tree edge decomposition with an applicat

Tree edge decomposition with an application to minimum ultrametric tree approximation

✍ Chia-Mao Huang; Bang Ye Wu; Chang-Biau Yang 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 265 KB

Application of the minimum spanning tree

Application of the minimum spanning tree algorithm to the planning of drainage systems

✍ Collins, Jean-Luc 📂 Article 📅 1994 🏛 Taylor and Francis Group 🌐 English ⚖ 209 KB