✦ LIBER ✦

On symbolic OBDD-based algorithms for the minimum spanning tree problem

✍ Scribed by Beate Bollig

Book ID: 116907320
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 310 KB
Volume: 447
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.11.029

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Offline Algorithms for Dynamic Minimum S

Offline Algorithms for Dynamic Minimum Spanning Tree Problems

✍ D. Eppstein 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 651 KB

We describe an efficient algorithm for maintaining a minimum spanning tree (MST) in a graph subject to a sequence of edge weight modifications. The sequence of minimum spanning trees is computed offline, after the sequence of modifications is known. The algorithm takes time \(O(k \log n)\) for a seq

On the generalized minimum spanning tree

On the generalized minimum spanning tree problem

✍ Young-Soo Myung; Chang-Ho Lee; Dong-Wan Tcha 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 748 KB

On the minimum diameter spanning tree pr

On the minimum diameter spanning tree problem

✍ Refael Hassin; Arie Tamir 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 199 KB

A one-parameter genetic algorithm for th

A one-parameter genetic algorithm for the minimum labeling spanning tree problem

✍ Yupei Xiong; Golden, B.; Wasil, E. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 410 KB

Randomized local search, evolutionary al

Randomized local search, evolutionary algorithms, and the minimum spanning tree problem

✍ Frank Neumann; Ingo Wegener 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 285 KB

Efficient minimum spanning tree algorith

Efficient minimum spanning tree algorithms on the reconfigurable mesh

✍ Yingyu Wan; Yinlong Xu; Xiaodong Gu; Guoliang Chen 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 831 KB