| تعداد نشریات | 126 |
| تعداد شمارهها | 7,094 |
| تعداد مقالات | 76,240 |
| تعداد مشاهده مقاله | 151,717,164 |
| تعداد دریافت فایل اصل مقاله | 113,810,166 |
Fr\'echet-Like Distances between Two Rooted Trees | ||
| Journal of Algorithms and Computation | ||
| مقاله 1، دوره 53، شماره 1، شهریور 2021، صفحه 1-12 اصل مقاله (421.87 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22059/jac.2021.81145 | ||
| نویسنده | ||
| Elena Farahbakhsh Touli* | ||
| Stockholm University, Department of Mathematics | ||
| چکیده | ||
| The purpose of this paper is to extend the definition of Fr'echet distance which measures the distance between two curves to a distance (Fr'echet-Like distance) which measures the similarity between two rooted trees. In this paper, I prove that the Fr'echet-Like distance between two trees is SNP-hard to compute. Later, I modify the definition of Fr'echet-Like distance to measure the distance between two merge trees, and I prove the relation between the interleaving distance and the modified Fr'echet-Like distance. | ||
| کلیدواژهها | ||
| Merge trees؛ Fr'echet distance؛ Fr'echet-Like distance؛ modified Fr'echet-Like distance؛ interleaving distance | ||
|
آمار تعداد مشاهده مقاله: 417 تعداد دریافت فایل اصل مقاله: 467 |
||