Computing connected components of simple undirected graphs based on generalized rough sets

  • Authors:

  • Jinkun Chen;Jinjin Li;Yaojin Lin

  • Affiliations:

  • Department of Mathematics and Information Science, Zhangzhou Normal University, Zhangzhou 363000, PR China;Department of Mathematics and Information Science, Zhangzhou Normal University, Zhangzhou 363000, PR China;Department of Computer Science and Engineering, Zhangzhou Normal University, Zhangzhou 363000, PR China

  • Venue:
  • Knowledge-Based Systems
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper studies the problem of computing connected components of a simple undirected graph based on generalized rough sets. Definable sets of generalized rough sets are used to characterize the connection of graphs. Based on the concept of k-step-upper approximations, an algorithm is designed for computing the connected components of a simple undirected graph. Experiments show that the new proposed algorithm gets a better performance compared to the classical algorithm. Also, this algorithm can be easily to realize in parallel and requires less processors.