11 search results - page 3 / 3 » Uniform Solution of Parity Games on Prefix-Recognizable Grap... |
NIPS
2001
14 years 10 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...