Connectedness of graph and matroid by covering-based rough sets (Q3300264)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Connectedness of graph and matroid by covering-based rough sets |
scientific article; zbMATH DE number 7225236
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Connectedness of graph and matroid by covering-based rough sets |
scientific article; zbMATH DE number 7225236 |
Statements
Connectedness of Graph and Matroid by Covering-Based Rough Sets (English)
0 references
28 July 2020
0 references
covering-based rough set
0 references
matroid
0 references
graph
0 references
connectedness
0 references
granular computing
0 references
0 references
0.9077643156051636
0 references
0.862007737159729
0 references
0.8433380126953125
0 references
0.8251622915267944
0 references
0.8108887672424316
0 references
