✦ LIBER ✦

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

✍ Scribed by Collins, Jean-Luc

Book ID: 126674088
Publisher: Taylor and Francis Group
Year: 1994
Tongue: English
Weight: 209 KB
Volume: 8
Category: Article
ISSN: 1389-5265
DOI: 10.1080/09208119408964753

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The expected complexity of Prim's minimu

The expected complexity of Prim's minimum spanning tree algorithm

✍ Chip Martel 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 60 KB

We study the expected performance of Prim's minimum spanning tree (MST) algorithm implemented using ordinary heaps. We show that this implementation runs in linear or almost linear expected time on a wide range of graphs. This helps to explain why Prim's algorithm often beats MST algorithms which ha

Improving the efficiency of parallel min

Improving the efficiency of parallel minimum spanning tree algorithms

✍ Ka Wong Chong; Yijie Han; Yoshihide Igarashi; Tak Wah Lam 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 203 KB

This paper presents results which improve the e ciency of parallel algorithms for computing the minimum spanning trees. For an input graph with n vertices and m edges our EREW PRAM algorithm runs in O(log n) time with O((m+n) log n) operations. Our CRCW PRAM algorithm runs in O(log n) time with O((m

Reoptimization of the minimum spanning t

Reoptimization of the minimum spanning tree

✍ Stratos A. Paschos; Vangelis Th. Paschos 📂 Article 📅 2011 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 155 KB

Comparison of Algorithms for the Degree

Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree

✍ Mohan Krishnamoorthy; Andreas T. Ernst; Yazid M. Sharaiha 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 163 KB

Enhanced second order algorithm applied

Enhanced second order algorithm applied to the capacitated minimum spanning tree problem

✍ Pedro Martins 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 375 KB