Sciweavers

ESA
1998
Springer
175views Algorithms» more  ESA 1998»
13 years 8 months ago
Computing the Edit-Distance between Unrooted Ordered Trees
An ordered tree is a tree in which each node's incident edges are cyclically ordered; think of the tree as being embedded in the plane. Let A and B be two ordered trees. The e...
Philip N. Klein