Connectedness of Graph and Matroid by Covering-Based Rough Sets (Q3300264)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Connectedness of Graph and Matroid by Covering-Based Rough Sets |
scientific article |
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
