Back to Search
Start Over
An application of rough sets to graph theory
- Source :
-
Information Sciences . Oct2012, Vol. 201, p114-127. 14p. - Publication Year :
- 2012
-
Abstract
- Abstract: 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. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 00200255
- Volume :
- 201
- Database :
- Academic Search Index
- Journal :
- Information Sciences
- Publication Type :
- Periodical
- Accession number :
- 74677944
- Full Text :
- https://doi.org/10.1016/j.ins.2012.03.009