Connectedness of graph and matroid by covering-based rough sets

DOI10.1007/978-3-319-25783-9_14MaRDI QIDQ3300264zbMATH OpenOpenAlexFDO

Authors Hui Li, William Zhu

Publication date 28 July 2020

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-319-25783-9_14

zbMATH Keywords

connectednesscovering-based rough setgranular computinggraphmatroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40) Graph theory (including graph drawing) in computer science (68R10) Reasoning under uncertainty in the context of artificial intelligence (68T37)

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

Cites work

• Characteristic matrix of covering and its application to Boolean matrix decomposition
• Connectedness of graphs and its application to connected matroids through covering-based rough sets
• Data mining of social networks represented as graphs
• Equivalent characterizations of some graph problems by covering-based rough sets
• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 4046636 (Why is no real title available?)
• New classes of clustering coefficient locally maximizing graphs
• Reduction and axiomization of covering generalized rough sets.
• Rough classification
• Rough sets
• Textural approach to generalized rough sets based on relations
• The algebraic structures of generalized rough set theory

Cited in

(6)

• On the connectivity of wireless network systems and an application in teacher-student interactive platforms
• 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
• Dependency structures for decision tables
• The connectivity of the covering approximation space
• Applications of Bipartite Graphs and their Adjacency Matrices to 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)