A rough set method for the vertex cover problem in graph theory
From MaRDI portal
Publication:2987912
DOI10.3233/IFS-151914zbMath1361.05131MaRDI QIDQ2987912
Anhui Tan, Jin Jin Li, Qing-Yuan Xu
Publication date: 18 May 2017
Published in: Journal of Intelligent & Fuzzy Systems (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Fractional graph theory, fuzzy graph theory (05C72)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Connections between covering-based rough sets and concept lattices
- An application of rough sets to graph theory
- Neighborhood systems and approximate retrieval
- Approximations and reducts with covering generalized rough sets
- Information granules and entropy theory in information systems
- Positive approximation: an accelerator for attribute reduction in rough set theory
- The independence number in graphs of maximum degree three
- Two views of the theory of rough sets in finite universes
- Relational interpretations of neighborhood operators and rough set approximation operators
- Representing a concept lattice by a graph
- Converse approximation and rule extraction from decision tables in rough set theory
- A new method for measuring uncertainty and fuzziness in rough set theory
- COMBINATION ENTROPY AND COMBINATION GRANULATION IN ROUGH SET THEORY
- Rough sets
- THE ALGORITHM ON KNOWLEDGE REDUCTION IN INCOMPLETE INFORMATION SYSTEMS
- Reduction algorithms based on discernibility matrix: The ordered attributes method
