Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets (Q4606359)
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: Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets |
scientific article; zbMATH DE number 6846456
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets |
scientific article; zbMATH DE number 6846456 |
Statements
Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets (English)
0 references
2 March 2018
0 references
approximation operator
0 references
adjacency matrix
0 references
bipartite graph
0 references
covering
0 references
covering-based rough set
0 references
0.9062084
0 references
0.90361553
0 references
0.90224516
0 references
0.8978672
0 references
0 references
0.88587105
0 references
0.8829764
0 references
0.87996477
0 references
