𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Using local search to speed up filtering algorithms for

✍ Scribed by Philippe Galinier; Alain Hertz; Sandrine Paroz; Gilles Pesant

Publisher
Springer US
Year
2010
Tongue
English
Weight
992 KB
Volume
184
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Technique to Speed Up Parallel Fully D
A Technique to Speed Up Parallel Fully Dynamic Algorithms for MST
✍ P. Ferragina πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 826 KB

We provide a new EREW PRAM algorithm to maintain the minimum spanning tree (MST) of an undirected weighted graph. Our approach combines the sparsification data structure with a novel parallel technique which efficiently treats single edge deletions. The proposed parallel algorithm requires \(O(\log