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

被引：10
|
作者：
Chen, Jinkun [1 ]
Li, Jinjin [1 ]
Lin, Yaojin [2 ]
机构：
[1] Zhangzhou Normal Univ, Dept Math & Informat Sci, Zhangzhou 363000, Peoples R China
[2] Zhangzhou Normal Univ, Dept Comp Sci & Engn, Zhangzhou 363000, Peoples R China
来源：
KNOWLEDGE-BASED SYSTEMS | 2013年 / 37卷
基金：
中国国家自然科学基金;
关键词：
Rough set; k-Step-upper approximation; Definable set; Connection; Connected component; EFFICIENT PARALLEL ALGORITHMS; KNOWLEDGE ACQUISITION; ATTRIBUTE REDUCTION; INFORMATION-SYSTEMS; APPROXIMATION;
D O I：
10.1016/j.knosys.2012.07.013
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
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. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码：80 / 85
页数：6
相关论文
共 50 条
  • [1] Finding strongly connected components of simple digraphs based on generalized rough sets theory
    Xu, Taihua
    Wang, Guoyin
    KNOWLEDGE-BASED SYSTEMS, 2018, 149 : 88 - 98
  • [2] Rough Set Theory Applied to Simple Undirected Graphs
    Chiaselotti, Giampiero
    Ciucci, Davide
    Gentile, Tommaso
    Infusino, Federico
    ROUGH SETS AND KNOWLEDGE TECHNOLOGY, RSKT 2015, 2015, 9436 : 423 - 434
  • [3] Undirected simple connected graphs with minimum number of spanning trees
    Bogdanowicz, Zbigniew R.
    DISCRETE MATHEMATICS, 2009, 309 (10) : 3074 - 3082
  • [4] Generalized rough sets based on relations
    Zhu, William
    INFORMATION SCIENCES, 2007, 177 (22) : 4997 - 5011
  • [5] Connectedness of graphs and its application to connected matroids through covering-based rough sets
    Aiping Huang
    William Zhu
    Soft Computing, 2016, 20 : 1841 - 1851
  • [6] Connectedness of graphs and its application to connected matroids through covering-based rough sets
    Huang, Aiping
    Zhu, William
    SOFT COMPUTING, 2016, 20 (05) : 1841 - 1851
  • [7] A study of connectivity on dynamic graphs: computing persistent connected components
    Mathilde Vernet
    Yoann Pigné
    Éric Sanlaville
    4OR, 2023, 21 : 205 - 233
  • [8] A study of connectivity on dynamic graphs: computing persistent connected components
    Vernet, Mathilde
    Pigne, Yoann
    Sanlaville, Eric
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2023, 21 (02): : 205 - 233
  • [9] On computing the 2-vertex-connected components of directed graphs
    Jaberi, Raed
    DISCRETE APPLIED MATHEMATICS, 2016, 204 : 164 - 172
  • [10] Rough sets in perception-based computing
    Skowron, A
    PATTERN RECOGNITION AND MACHINE INTELLIGENCE, PROCEEDINGS, 2005, 3776 : 21 - 29
12345