Connectedness of graphs and its application to connected matroids through covering-based rough sets
From MaRDI portal
Publication:2402114
DOI10.1007/s00500-015-1859-2zbMath1370.05118arXiv1312.4234OpenAlexW1808456820MaRDI QIDQ2402114
Publication date: 6 September 2017
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.4234
Reasoning under uncertainty in the context of artificial intelligence (68T37) Combinatorial aspects of matroids and geometric lattices (05B35) Data structures (68P05) Connectivity (05C40)
Related Items
A dynamic approach for updating the lower approximation in adjustable multi-granulation rough sets, Connectedness of Graph and Matroid by Covering-Based Rough Sets
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Three-objective subgraph mining using multiobjective evolutionary programming
- Claw-free graphs with strongly perfect complements. Fractional and integral version. I: Basic graphs
- Attribute reduction of data with error ranges and test costs
- Data mining of social networks represented as graphs
- The relationship among different covering approximations
- A novel method for attribute reduction of covering decision systems
- Axiomatization and conditions for neighborhoods in a covering to form a partition
- Covering rough sets based on neighborhoods: an approach without using neighborhoods
- The fourth type of covering-based rough sets
- New classes of clustering coefficient locally maximizing graphs
- On axiomatic characterizations of three pairs of covering based approximation operators
- Nullity-based matroid of rough sets and its application to attribute reduction
- Characteristic matrix of covering and its application to Boolean matrix decomposition
- Relationship between generalized rough sets based on binary relation and covering
- Reduction and axiomization of covering generalized rough sets.
- Geometric lattice structure of covering and its application to attribute reduction through matroids
- Matroidal structure of rough sets from the viewpoint of graph theory
- Texture aware image segmentation using graph cuts and active contours
- Geometric lattice structure of covering-based rough sets through matroids
- Quantitative analysis for covering-based rough sets through the upper approximation number
- Infinite matroids in graphs
- Four matroidal structures of covering and their relationships with rough sets
- Equivalent characterizations of some graph problems by covering-based rough sets
- Relationship among basic concepts in covering-based rough sets
- The graph matching problem
- Related family: a new method for attribute reduction of covering information systems
- Stochastic Failure Prognosability of Discrete Event Systems
- Rough sets
- Matroids and the greedy algorithm
