Scholarlink

Strongly Connected Components (SCCs) play a crucial role in understanding the structural properties of directed graphs, with a plethora of applications across various domains including engineering, computer science and social sciences. In this paper, we propose a method for computing both the source SCCs and target SCCs in a distributed fashion. Our method leverages the decentralized nature of distributed systems to efficiently identify SCCs within large-scale graphs. We illustrate the proposed methods with examples.

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

Distributed Computation of Source, Target, and Mixed Strongly Connected Components in Multi-agent Systems

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Guilherme Ramos,
  • Sérgio Pequito

摘要

Strongly Connected Components (SCCs) play a crucial role in understanding the structural properties of directed graphs, with a plethora of applications across various domains including engineering, computer science and social sciences. In this paper, we propose a method for computing both the source SCCs and target SCCs in a distributed fashion. Our method leverages the decentralized nature of distributed systems to efficiently identify SCCs within large-scale graphs. We illustrate the proposed methods with examples.