A Distributed Algorithm for Identifying Strongly Connected Components on Incremental Graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A Distributed Algorithm for Identifying Strongly Connected Components on Incremental Graphs

Published:2023-10-17 Issue: Volume: Page:
ISSN:
Container-title:2023 IEEE 35th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)
language:
Short-container-title:

Author:

Srinivasan S.¹,Khanda A.²,Srinivasan S.¹,Pandey A.³,Das S. K.²,Bhowmick S.³,Norris B.¹

Affiliation:

1. University of Oregon,Department of Computer Science,Eugene,OR,USA,97403

2. Missouri University of Science and Technology,Department of Computer Science,Rolla,MO,USA,65401

3. Bowie State University,Department of Management Information Systems,MD,20715

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/10305712/10305717/10306221.pdf?arnumber=10306221

Reference28 articles.

1. A Shared-Memory Parallel Algorithm for Updating Single-Source Shortest Paths in Large Dynamic Networks

2. A Parallel Algorithm Template for Updating Single-Source Shortest Paths in Large-Scale Dynamic Networks

3. Incremental scc maintenance in sparse graphs;bernstein;29th Annual European Symposium on Algorithms (ESA 2021),0

4. Parallel Vertex Color Update on Large Dynamic Networks

5. A Shared-Memory Algorithm for Updating Tree-Based Properties of Large Dynamic Networks

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP