IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i11p1723-d1406714.html
   My bibliography  Save this article

A Granulation Strategy-Based Algorithm for Computing Strongly Connected Components in Parallel

Author

Listed:
  • Huixing He

    (School of Computer, Jiangsu University of Science and Technology, Zhenjiang 212100, China)

  • Taihua Xu

    (School of Computer, Jiangsu University of Science and Technology, Zhenjiang 212100, China)

  • Jianjun Chen

    (School of Computer, Jiangsu University of Science and Technology, Zhenjiang 212100, China)

  • Yun Cui

    (School of Computer, Jiangsu University of Science and Technology, Zhenjiang 212100, China)

  • Jingjing Song

    (School of Computer, Jiangsu University of Science and Technology, Zhenjiang 212100, China)

Abstract

Granular computing (GrC) is a methodology for reducing the complexity of problem solving and includes two basic aspects: granulation and granular-based computing. Strongly connected components (SCCs) are a significant subgraph structure in digraphs. In this paper, two new granulation strategies were devised to improve the efficiency of computing SCCs. Firstly, four SCC correlations between the vertices were found, which can be divided into two classes. Secondly, two granulation strategies were designed based on correlations between two classes of SCCs. Thirdly, according to the characteristics of the granulation results, the parallelization of computing SCCs was realized. Finally, a parallel algorithm based on granulation strategy for computing SCCs of simple digraphs named GPSCC was proposed. Experimental results show that GPSCC performs with higher computational efficiency than algorithms.

Suggested Citation

  • Huixing He & Taihua Xu & Jianjun Chen & Yun Cui & Jingjing Song, 2024. "A Granulation Strategy-Based Algorithm for Computing Strongly Connected Components in Parallel," Mathematics, MDPI, vol. 12(11), pages 1-16, May.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:11:p:1723-:d:1406714
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/11/1723/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/11/1723/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:11:p:1723-:d:1406714. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.