✦ LIBER ✦

Efficient spanning trees

✍ Scribed by H. W. Corley

Publisher: Springer
Year: 1985
Tongue: English
Weight: 210 KB
Volume: 45
Category: Article
ISSN: 0022-3239
DOI: 10.1007/bf00938448

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing capacitated minimal spanning t

Computing capacitated minimal spanning trees efficiently

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

Efficient minimum spanning tree construc

Efficient minimum spanning tree construction without Delaunay triangulation

✍ Hai Zhou; Narendra Shenoy; William Nicholls 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 77 KB

Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs of points and takes at least (n 2 ) time. More efficient approaches find a minimum spanning tree only among edges in the D

Balancing two spanning trees

✍ Matthias Kriesell 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB

Minimal ratio spanning trees

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

Ends in spanning trees

✍ Xingxing Yu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 97 KB

We refer to for terminology not specified here. Graphs mentioned in this note are undirected, simple. The following definition is due to Halin [l]: an end E of an infinite graph G is a set of l-way infinite paths in G such that P, Q E E iff for any finite subset R of V(G) there is a finite path in

Finding theksmallest spanning trees

✍ David Eppstein 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 763 KB