Connectedness of Graph and Matroid by Covering-Based Rough Sets

DOI10.1007/978-3-319-25783-9_14zbMath1444.68148OpenAlexW2292988452MaRDI QIDQ3300264

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

zbMATH Keywords

connectednessgraphmatroidgranular computingcovering-based rough set

Mathematics Subject Classification ID

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)

Related Items (1)

Dependency structures for decision tables

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• The algebraic structures of generalized rough set theory
• Reduction and axiomization of covering generalized rough sets.
• Textural approach to generalized rough sets based on relations
• 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
• Rough classification
• Rough sets

This page was built for publication: Connectedness of Graph and Matroid by Covering-Based Rough Sets