کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4944481 | 1437992 | 2017 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A comparative analysis of new graph distance measures and graph edit distance
ترجمه فارسی عنوان
یک تجزیه و تحلیل تطبیقی از فاصله های جدید فاصله گراف و فاصله ویرایش گراف
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
اندازه گیری فاصله، شباهت گراف، ویرایش فاصله، شاخص توپولوژیک،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
چکیده انگلیسی
The problem of determining the structural similarity or distance between graphs got considerable attention during the last decades; consequently, various similarity and distance measures for networks have already been investigated. Dehmer et al. studied a new distance measure for graphs, which is based on topological indices. An interesting problem is to compare our class of measures with the well-known graph edit distance, which has been studied extensively and often serves as a benchmark measure; but note that GED is generally NP-hard. In this paper, we compare the edit distance with our graph distance measures; in order to do so we use some well-known topological indices such as graph energy, Wiener index, RandiÄ index and graph entropy. By using several special graph classes numerical results reveal that the graph distance measure based on graph energy approximates GED well. This fact could trigger an important research direction for studying graph edit distance and other comparative network measures.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Sciences - Volumes 403â404, September 2017, Pages 15-21
Journal: Information Sciences - Volumes 403â404, September 2017, Pages 15-21
نویسندگان
Tao Li, Han Dong, Yongtang Shi, Matthias Dehmer,