کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
405203 | 677510 | 2013 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Computing connected components of simple undirected graphs based on generalized rough sets
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Knowledge-Based Systems - Volume 37, January 2013, Pages 80–85
Journal: Knowledge-Based Systems - Volume 37, January 2013, Pages 80–85
نویسندگان
Jinkun Chen, Jinjin Li, Yaojin Lin,