✦ LIBER ✦

An Algorithm for Finding K Minimum Spanning Trees

✍ Scribed by Katoh, N.; Ibaraki, T.; Mine, H.

Book ID: 118174070
Publisher: Society for Industrial and Applied Mathematics
Year: 1981
Tongue: English
Weight: 964 KB
Volume: 10
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0210017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An 0(|E|loglog|V|) algorithm for finding

An 0(|E|loglog|V|) algorithm for finding minimum spanning trees

✍ Andrew Chi-chih Yao 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 379 KB

Incremental distributed asynchronous alg

Incremental distributed asynchronous algorithm for minimum spanning trees

✍ Yung H. Tsin 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 459 KB

A parallel algorithm for constructing mi

A parallel algorithm for constructing minimum spanning trees

✍ Jon Louis Bentley 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 521 KB

A Parallel Algorithm for Computing Minim

A Parallel Algorithm for Computing Minimum Spanning Trees

✍ D.B. Johnson; P. Metaxas 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 840 KB

We present a simple and implementable algorithm that computes a minimum spanning tree of an undirected weighted graph \(G=(V, E)\) of \(n=|V|\) vertices and \(m=|E|\) edges on an EREW PRAM in \(O\left(\log ^{3 / 2} n\right)\) time using \(n+m\) processors. This represents a substantial improvement i

Algorithms for finding and updating mini

Algorithms for finding and updating minimum-depth spanning trees in parallel

✍ Pranay Chaudhuri; Asad A. Ismaeel 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 564 KB

Approximating k-hop minimum-spanning tre

Approximating k-hop minimum-spanning trees

✍ Ernst Althaus; Stefan Funke; Sariel Har-Peled; Jochen Könemann; Edgar A. Ramos; 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 231 KB