首页> 外文期刊>Journal of logic and computation >Distributed Algorithms for SCC Decomposition
【24h】

Distributed Algorithms for SCC Decomposition

机译:SCC分解的分布式算法

获取原文
获取原文并翻译 | 示例
       

摘要

We study existing parallel algorithms for the decomposition of a partitioned graph into its strongly connected components (SCCs). In particular, we identify several individual procedures that the algorithms are assembled from and show how to assemble a new and more efficient algorithm, called Recursive OBF (OBFR), to solve the decomposition problem. We also report on a thorough experimental study to evaluate the new algorithm. It shows that it is possible to perform SCC decomposition in parallel efficiently and that OBFR, if properly implemented, is the best choice in most cases.
机译:我们研究了现有的并行算法,用于将分区图分解为其强连接的组件(SCC)。特别是,我们确定了从中组装算法的几个单独过程,并展示了如何组装一种新的更有效的算法,即递归OBF(OBFR),以解决分解问题。我们还报告了一项彻底的实验研究,以评估新算法。它表明可以有效地并行执行SCC分解,并且如果正确实现,OBFR在大多数情况下是最佳选择。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号