Finding strongly connected components of simple digraphs based on granulation strategy (Q2302953)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7174797
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding strongly connected components of simple digraphs based on granulation strategy |
scientific article; zbMATH DE number 7174797 |
Statements
Finding strongly connected components of simple digraphs based on granulation strategy (English)
0 references
26 February 2020
0 references
strongly connected components
0 references
rough set theory
0 references
graph theory
0 references
granulation strategy
0 references
0 references
0 references
0 references
0.90578735
0 references
0.8894551
0 references
0.8808968
0 references
0 references
0 references
