Scholarlink

We provide a working implementation of DP_Kruskal; a parallel, distributed and concurrent adaptation of Kruskal algorithm that keeps the input graph distributed along a pipeline and computes online its minimum spanning tree (or forest) in the Go programming language. We show experimentally that DP_Kruskal is competitive and scales well to a large number of processes. Our experimental study is done for a large class of dynamic random graphs –including several densities and sizes– and some real dynamic graphs.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

DP_Kruskal: A Concurrent Algorithm to Maintain Dynamically Minimum Spanning Trees

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Daniel Benedí,
  • Amalia Duch,
  • Edelmira Pasarella,
  • Cristina Zoltan

摘要

We provide a working implementation of DP_Kruskal; a parallel, distributed and concurrent adaptation of Kruskal algorithm that keeps the input graph distributed along a pipeline and computes online its minimum spanning tree (or forest) in the Go programming language. We show experimentally that DP_Kruskal is competitive and scales well to a large number of processes. Our experimental study is done for a large class of dynamic random graphs –including several densities and sizes– and some real dynamic graphs.