Connectedness of graph and matroid by covering-based rough sets
DOI10.1007/978-3-319-25783-9_14zbMATH Open1444.68148OpenAlexW2292988452MaRDI QIDQ3300264FDOQ3300264
Authors: Hui Li, William Zhu 
Publication date: 28 July 2020
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-25783-9_14
Recommendations
- Connectedness of graphs and its application to connected matroids through covering-based rough sets
- Covering-based rough sets on Eulerian matroids
- Equivalent characterizations of some graph problems by covering-based rough sets
- Four matroidal structures of covering and their relationships with rough sets
- Matroidal structure of rough sets from the viewpoint of graph theory
Graph theory (including graph drawing) in computer science (68R10) Reasoning under uncertainty in the context of artificial intelligence (68T37) Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)
Cites Work
- Rough sets
- Reduction and axiomization of covering generalized rough sets.
- Title not available (Why is that?)
- Title not available (Why is that?)
- The algebraic structures of generalized rough set theory
- Textural approach to generalized rough sets based on relations
- Rough classification
- Data mining of social networks represented as graphs
- New classes of clustering coefficient locally maximizing graphs
- Characteristic matrix of covering and its application to Boolean matrix decomposition
- Equivalent characterizations of some graph problems by covering-based rough sets
- Connectedness of graphs and its application to connected matroids through covering-based rough sets
Cited In (6)
- The connectivity of the covering approximation space
- On the connectivity of wireless network systems and an application in teacher-student interactive platforms
- Connectedness of graphs and its application to connected matroids through covering-based rough sets
- Dependency structures for decision tables
- Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets
- Equivalent characterizations of some graph problems by covering-based rough sets
This page was built for publication: Connectedness of graph and matroid by covering-based rough sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3300264)
