.png){kind=icon}
返回
Finding strongly connected components in distributed graphs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2005.03.007.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The traditional, serial, algorithm for finding the strongly connected components in a graph is based on depth first search and has complexity which is linear in the size of the graph. Depth first search is difficult to parallelize, which creates a need for a different parallel algorithm for this problem. We describe the implementation of a recently proposed parallel algorithm that finds strongly connected components in distributed graphs, and discuss how it is used in a radiation transport solver. (c) 2005 Elsevier Inc. All rights reserved.
Keyword:
strongly connected components
graph algorithm
parallel computing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
分享收藏Optimised Anaesthesia to Reduce Post Operative Cognitive Decline (POCD) in Older Patients Undergoing Elective Surgery, a Randomised Controlled Trial.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏
分享收藏Thirty-five–year Trends in First-time Hospitalization for Hip Fracture, 1-year Mortality, and the Prognostic Impact of ComorbidityEpidemiology
EpidemiologyIF0
PREAI
分享收藏分享收藏 没有更多内容
没有更多内容