Results 1  10
of
2,414
Efficient algorithms for the tree homeomorphism problem
 In DBPL
, 2007
"... Abstract. 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 develop efficient algorithms for the tree homeomorphism problem, i.e., the problem of matching a tree pattern with ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Abstract. 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 develop efficient algorithms for the tree homeomorphism problem, i.e., the problem of matching a tree pattern
Integral trees homeomorphic to a double star
, 2009
"... Trees with two nonadjacent vertices of degree larger than two are not integral. This settles a question by Watanabe & Schwenk (1979). 1 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Trees with two nonadjacent vertices of degree larger than two are not integral. This settles a question by Watanabe & Schwenk (1979). 1
Fax: +810117067680Faster BitParallel Algorithms for Unordered PseudoTree Matching and Tree Homeomorphism
, 2010
"... Abstract. In this paper, we consider the unordered pseudotree matching problem, which is a problem of, given two unordered labeled trees P and T, finding all occurrences of P in T via such manyone embeddings that preserve node labels and parentchild relationship. This problem is closely related t ..."
Abstract
 Add to MetaCart
of nodes in P, n is the number of nodes in T, h is the height of T, and w is the word length. We also discuss a modification of our algorithm for the unordered tree homeomorphism problem, which corresponds to a tree pattern matching problem for XPath queries with descendant axis only. 1
Wiener index of iterated line graphs of trees homeomorphic to the clawK1,3
, 2012
"... Let G be a graph. Denote by Li(G) its iiterated line graph and denote by W (G) its Wiener index. Dobrynin, Entringer and Gutman stated the following problem: Does there exist a nontrivial tree T and i ≥ 3 such that W (Li(T)) = W (T)? In a series of five papers we solve this problem. In a previous ..."
Abstract
 Add to MetaCart
previous paper we proved that W (Li(T))> W (T) for every tree T that is not homeomorphic to a path, claw K1,3 and to the graph of “letter H”, where i ≥ 3. Here we prove that W (Li(T))> W (T) for every tree T homeomorphic to the claw, T 6 = K1,3 and i ≥ 4.
Homeomorphic Alignment of Weighted Trees
, 2009
"... Motion capture is a currently active research area. One of the problems to be solved is the estimation of the pose of the subject. This requires a match between a model and a 3D shape, constructed using a multiview system. Our purpose is to realize it in realtime, using the tree representation of t ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Motion capture is a currently active research area. One of the problems to be solved is the estimation of the pose of the subject. This requires a match between a model and a 3D shape, constructed using a multiview system. Our purpose is to realize it in realtime, using the tree representation
Homeomorphic Alignment of Weighted Trees
, 2012
"... 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 to a prespecified tree model. Unfortunately, the tree representation can contain vertices that split limbs in multiple pa ..."
Abstract
 Add to MetaCart
parts, which do not allow a good match by usual methods. To solve this problem, we propose a new alignment, taking into account the homeomorphism between trees, rather than the isomorphism, as in prior works. Then, we develop several computationally efficient algorithms for reaching realtime motion
Approximate labelled subtree homeomorphism
 In Proceedings of 15th Annual Symposium of Combinatorial Pattern Matching
, 2004
"... Abstract. 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 repeatedly removing a degree2 node and adding the edge joining its two neighbors. In this paper we extend the S ..."
Abstract

Cited by 25 (3 self)
 Add to MetaCart
Abstract. 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 repeatedly removing a degree2 node and adding the edge joining its two neighbors. In this paper we extend
Treelike continua do not admit expansive homeomorphisms
 PROC. AMER. MATH. SOC
, 2002
"... A homeomorphism h: X → X is called expansive provided that for some fixed c> 0 and every x, y ∈ X there exists an integer n, dependent only on x and y, such that d(hn(x), hn(y))> c. It is shown that if X is a treelike continuum, then h cannot be expansive. ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
A homeomorphism h: X → X is called expansive provided that for some fixed c> 0 and every x, y ∈ X there exists an integer n, dependent only on x and y, such that d(hn(x), hn(y))> c. It is shown that if X is a treelike continuum, then h cannot be expansive.
Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology
"... We are given a set T = fT1 ; T2 ; : : : ; Tkg of rooted binary trees, each T i leaflabeled by a subset L(T i ) ae f1; 2; : : : ; ng. If T is a tree on f1; 2; : : : ; ng, we let TjL denote the minimal subtree of T induced by the nodes of L and all their ancestors. The consensus tree problem asks wh ..."
Abstract

Cited by 47 (2 self)
 Add to MetaCart
whether there exists a tree T such that for every i, T jL(T i ) is homeomorphic to T i . We present algorithms which test if a given set of trees has a consensus tree and if so, construct one. The deterministic algorithm takes time minfO(Nn 1=2 ); O(N + n 2 log n)g, where N = P i jT i j
Constructing a Tree from Homeomorphic Subtrees, with
 Algorithmica
, 1999
"... We are given a set T: {T, T,..., T} of rooted binary trees, each T leaflabeled by a subset (T) C {1,2,..., n}. If T is a tree on {1, 2,...,n}, we let T[ denote the subtree oft induced by the nodes of and all their ancestors. The consensus ir' problem asks whether there exists a tree T* such ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
* such that for every i, T* [(Ti) is homeomorphic to Ti. The consensus tree problem has applications in computational biology and in the theory of relational data bases.
Results 1  10
of
2,414