کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1712959 | 1013210 | 2008 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Simulated annealing algorithm for detecting graph isomorphism*
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
کنترل و سیستم های مهندسی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem (GIP) is a nondeterministic polynomial problem. A simulated annealing (SA) algorithm for detecting graph isomorphism is proposed, and the proposed SA algorithm is well suited to deal with random graphs with large size. To verify the validity of the proposed SA algorithm, simulations are performed on three pairs of small graphs and four pairs of large random graphs with edge densities 0.5, 0.1, and 0.01, respectively. The simulation results show that the proposed SA algorithm can detect graph isomorphism with a high probability.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Systems Engineering and Electronics - Volume 19, Issue 5, August 2008, Pages 1047-1052
Journal: Journal of Systems Engineering and Electronics - Volume 19, Issue 5, August 2008, Pages 1047-1052
نویسندگان
Geng Xiutang, Zhang Kai,