Efficient parallel algorithm for finding strongly connected components based on granulation strategy

Strongly connected components (SCCs) are a significant subgraph structure in digraphs. In the previous work, an algorithm based on rough set theory (RST) called KGRSCC was proposed, which can compute SCCs with high efficiency. Notably, KGRSCC utilized a granulation strategy, which was designed based...

Full description

Bibliographic Details

Published in:	Knowledge and information systems Vol. 67; no. 3; pp. 2855 - 2879
Main Authors:	Xu, Taihua, He, Huixing, Yang, Xibei, Yang, Jie, Song, Jingjing, Cui, Yun
Format:	Journal Article
Language:	English
Published:	London Springer Nature B.V 01.03.2025
Subjects:	Algorithms Apexes Computing time Correlation Efficiency Granular materials Granulation Graph theory Set theory Vertex sets
ISSN:	0219-1377, 0219-3116
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!