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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Knowledge and information systems Jg. 67; H. 3; S. 2855 - 2879
Hauptverfasser:	Xu, Taihua, He, Huixing, Yang, Xibei, Yang, Jie, Song, Jingjing, Cui, Yun
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	London Springer Nature B.V 01.03.2025
Schlagworte:	Algorithms Apexes Computing time Correlation Efficiency Granular materials Granulation Graph theory Set theory Vertex sets
ISSN:	0219-1377, 0219-3116
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!