𝔖 Bobbio Scriptorium
✦   LIBER   ✦

2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) || Randomized Speedup of the Bellman–Ford Algorithm

✍ Scribed by Hwang, Hsien-Kuei; Martínez, Conrado

Book ID
125522724
Publisher
Society for Industrial and Applied Mathematics
Year
2012
Weight
383 KB
Volume
10.1137/1.9781611973020
Category
Article
ISBN
1611973023

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Proceedings of the 6th Workshop on Algor
Proceedings of the 6th Workshop on Algorithm Engineering and 1st workshop on Combinatorics
✍ Lars Arge 📂 Library 📅 2004 🏛 Society for Industrial & Applied 🌐 English ⚖ 4 MB

The aim of the annual ALENEX workshop is to provide a forum for the presentation of original research in the implementation and experimental evaluation of algorithms and data structures. This research presents significant studies in experimental analysis or in the implementation, testing, and evalua

[ACM Press the 1st International Worksho
[ACM Press the 1st International Workshop - Beijing, China (2012.08.12-2012.08.12)] Proceedings of the 1st International Workshop on Big Data, Streams and Heterogeneous Source Mining Algorithms, Systems, Programming Models and Applications - BigMine '12 - A parallel graph partitioning algorithm to speed up the large-scale distributed graph mining
✍ Zeng, ZengFeng; Wu, Bin; Wang, Haoyu 📂 Article 📅 2012 🏛 ACM Press ⚖ 730 KB

For the large-scale distributed graph mining, the graph is distributed over a cluster of nodes, thus performing computations on the distributed graph is expensive when large amount of data have to be moved between different computers. A good partitioning of distributed graph is needed to reduce the