Coloring based approach for matching unrooted and/or unordered trees
| dc.contributor.author | Yahiaoui, Saïd | |
| dc.contributor.author | Haddad, Mohammed | |
| dc.contributor.author | Effantin, Brice | |
| dc.contributor.author | Kheddouci, Hamamache | |
| dc.date.accessioned | 2023-02-26T09:48:55Z | |
| dc.date.available | 2023-02-26T09:48:55Z | |
| dc.date.issued | 2013-04 | |
| dc.description.abstract | We consider the problem of matching unrooted unordered labeled trees, which refers to the task of evaluating the distance between trees. One of the most famous formalizations of this problem is the computation of the edit distance defined as the minimum-cost sequence of edit operations that transform one tree into another. Unfortunately, this problem has been proved to be NP-complete. In this paper, we propose a new algorithm to measure distance between unrooted unordered labeled trees. This algorithm uses a specific graph coloring to decompose the trees into small components (stars and bistars). Then, it determines a distance between two trees by computing the edit distance between their components. We prove that the proposed distance is a pseudo-metric and we analyze its time complexity. Our experimental evaluations on large synthetic and real world datasets confirm our analytical results and suggest that the distance we propose is accurate and its algorithm is scalable. | |
| dc.identifier.issn | 0167-8655 | |
| dc.identifier.issn | 1872-7344 | |
| dc.identifier.uri | https://dl.cerist.dz/handle/CERIST/968 | |
| dc.publisher | Elsevier | |
| dc.relation.ispartofseries | Pattern Recognition Letters; Vol. 34 - N° 6 | |
| dc.relation.pages | 686-695 | |
| dc.structure | Calcul pervasif et mobile (Pervasive and Mobile Computing group) | |
| dc.subject | Edit distance | |
| dc.subject | Graph matching | |
| dc.subject | Unrooted tree | |
| dc.subject | Unordered tree | |
| dc.title | Coloring based approach for matching unrooted and/or unordered trees | |
| dc.type | Article |