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

Celý popis

Podrobná bibliografie

Vydáno v:	Knowledge and information systems Ročník 67; číslo 3; s. 2855 - 2879
Hlavní autoři:	Xu, Taihua, He, Huixing, Yang, Xibei, Yang, Jie, Song, Jingjing, Cui, Yun
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	London Springer Nature B.V 01.03.2025
Témata:	Algorithms Apexes Computing time Correlation Efficiency Granular materials Granulation Graph theory Set theory Vertex sets
ISSN:	0219-1377, 0219-3116
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!