334 search results - page 1 / 67 » Efficient Algorithms for the Tree Homeomorphism Problem |
DBPL
2007
Springer
13 years 8 months ago
2007
Springer
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we deve...
CPM
2004
Springer
13 years 10 months ago
2004
Springer
For a set of rooted, unordered, distinctly leaf-labeled trees, the NP-hard maximum agreement subtree problem (MAST) asks for a tree contained (up to isomorphism or homeomorphism) i...
PR
2010
13 years 2 months ago
2010
Motion capture, a currently active research area, needs estimation of the pose of the subject. For this purpose, we match the tree representation of the skeleton of the 3D shape t...
CPM
2004
Springer
13 years 10 months ago
2004
Springer
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 ...
STOC
1991
ACM
13 years 8 months ago
1991
ACM
act We give an algorithm for imbedding a graph G of n vertices onto an oriented surface of minimal genus g. If g > 0 then we also construct a forbidden subgraph of G which is ho...