Sciweavers

CPM
2004
Springer
109views Combinatorics» more  CPM 2004»
14 years 22 days ago
Approximate Labelled Subtree Homeomorphism
Given two undirected trees T and P, the Subtree Homeomorphism Problem is to find whether T has a subtree t that can be transformed into P by removing entire subtrees, as well as ...
Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal ...