کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4634506 | 1340694 | 2007 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Structural similarity of directed universal hierarchical graphs: A low computational complexity approach
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Structural similarity of directed universal hierarchical graphs: A low computational complexity approach Structural similarity of directed universal hierarchical graphs: A low computational complexity approach](/preview/png/4634506.png)
چکیده انگلیسی
In the present paper we mainly introduce an efficient approach to measure the structural similarity of so called directed universal hierarchical graphs. We want to underline that directed universal hierarchical graphs can be obtained from generalized trees which are already introduced. In order to classify these graphs, we state our novel graph similarity method. As a main result we notice that our novel algorithm has low computational complexity.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 194, Issue 1, 1 December 2007, Pages 7-20
Journal: Applied Mathematics and Computation - Volume 194, Issue 1, 1 December 2007, Pages 7-20
نویسندگان
Matthias Dehmer, Frank Emmert-Streib,