Search: 1, Diff, Theory, Conference, 1995

1 result

Results

On the Editing Distance between Undirected Acyclic Graphs and Related Problems

... edit distance on strings and trees have been developed [1, 9, 10, 17, 27]. Our degree-2 distance, when applied to unordered trees, is ... deletions and insertions occur at leaves i.e., with degree 1.) In this extended abstract, we present algorithms for computing the ...

Publication - huliganka - 04/16/2013 - 06:16 - 0 comments - 0 attachments