On relationship between modified sets, topological spaces and rough sets
Fuzzy Sets and Systems
Tolerance approximation spaces
Fundamenta Informaticae - Special issue: rough sets
Rough set approach to incomplete information systems
Information Sciences: an International Journal
Rules in incomplete information systems
Information Sciences: an International Journal
A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs
Journal of the ACM (JACM)
An algorithm for finding a fundamental set of cycles of a graph
Communications of the ACM
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
A Generalized Definition of Rough Approximations Based on Similarity
IEEE Transactions on Knowledge and Data Engineering
On Generalizing Pawlak Approximation Operators
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
About Tolerance and Similarity Relations in Information Systems
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
On the structure of rough approximations
Fundamenta Informaticae
Benchmarking Attribute Selection Techniques for Discrete Class Data Mining
IEEE Transactions on Knowledge and Data Engineering
Outlier Mining in Large High-Dimensional Data Sets
IEEE Transactions on Knowledge and Data Engineering
Algorithm Design
Graph Theory With Applications
Graph Theory With Applications
Rough set based 1-v-1 and 1-v-r approaches to support vector machine multi-classification
Information Sciences: an International Journal
On definable concepts of rough set models
Information Sciences: an International Journal
The algebraic structures of generalized rough set theory
Information Sciences: an International Journal
Relationship between generalized rough sets based on binary relation and covering
Information Sciences: an International Journal
Graph Theory
A hierarchical model for test-cost-sensitive decision systems
Information Sciences: an International Journal
Set-valued ordered information systems
Information Sciences: an International Journal
On fuzzy rough sets based on tolerance relations
Information Sciences: an International Journal
Information Sciences: an International Journal
MGRS: A multi-granulation rough set
Information Sciences: an International Journal
Constructive and algebraic methods of the theory of rough sets
Information Sciences: an International Journal
Knowledge reduction in random information systems via Dempster-Shafer theory of evidence
Information Sciences: an International Journal
On the structure of generalized rough sets
Information Sciences: an International Journal
Fuzzy preference based rough sets
Information Sciences: an International Journal
Information Sciences: an International Journal
Information Sciences: an International Journal
Information Sciences: an International Journal
A comparison of two kinds of definitions of rough approximations based on a similarity relation
Information Sciences: an International Journal
Quantitative analysis for covering-based rough sets through the upper approximation number
Information Sciences: an International Journal
Information Sciences: an International Journal
Computing connected components of simple undirected graphs based on generalized rough sets
Knowledge-Based Systems
Multigranulation rough sets: From partition to covering
Information Sciences: an International Journal
| Hi-index | 0.07 |
This paper studies the testing bipartiteness of simple undirected graphs based on generalized rough sets. A new binary relation induced from a simple undirected graph is first defined. The concept of quasi-outer definable sets is then introduced, and some of its important properties are investigated. Finally, based on the quasi-outer definable set, a new algorithm is designed for testing bipartiteness of a simple undirected graph. Experiments show that the proposed algorithm is more efficient than the traditional one when the graph is represented by an adjacency matrix.