3,006 research outputs found
Faster Algorithms for the Maximum Common Subtree Isomorphism Problem
The maximum common subtree isomorphism problem asks for the largest possible
isomorphism between subtrees of two given input trees. This problem is a
natural restriction of the maximum common subgraph problem, which is -hard in general graphs. Confining to trees renders polynomial time
algorithms possible and is of fundamental importance for approaches on more
general graph classes. Various variants of this problem in trees have been
intensively studied. We consider the general case, where trees are neither
rooted nor ordered and the isomorphism is maximum w.r.t. a weight function on
the mapped vertices and edges. For trees of order and maximum degree
our algorithm achieves a running time of by
exploiting the structure of the matching instances arising as subproblems. Thus
our algorithm outperforms the best previously known approaches. No faster
algorithm is possible for trees of bounded degree and for trees of unbounded
degree we show that a further reduction of the running time would directly
improve the best known approach to the assignment problem. Combining a
polynomial-delay algorithm for the enumeration of all maximum common subtree
isomorphisms with central ideas of our new algorithm leads to an improvement of
its running time from to ,
where is the order of the larger tree, is the number of different
solutions, and is the minimum of the maximum degrees of the input
trees. Our theoretical results are supplemented by an experimental evaluation
on synthetic and real-world instances
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs
The Graph Isomorphism problem restricted to graphs of bounded treewidth or
bounded tree distance width are known to be solvable in polynomial time
[Bod90],[YBFT99]. We give restricted space algorithms for these problems
proving the following results: - Isomorphism for bounded tree distance width
graphs is in L and thus complete for the class. We also show that for this kind
of graphs a canon can be computed within logspace. - For bounded treewidth
graphs, when both input graphs are given together with a tree decomposition,
the problem of whether there is an isomorphism which respects the
decompositions (i.e. considering only isomorphisms mapping bags in one
decomposition blockwise onto bags in the other decomposition) is in L. - For
bounded treewidth graphs, when one of the input graphs is given with a tree
decomposition the isomorphism problem is in LogCFL. - As a corollary the
isomorphism problem for bounded treewidth graphs is in LogCFL. This improves
the known TC1 upper bound for the problem given by Grohe and Verbitsky
[GroVer06].Comment: STACS conference 2010, 12 page
Invariant subsets of scattered trees. An application to the tree alternative property of Bonato and Tardif
A tree is scattered if no subdivision of the complete binary tree is a
subtree. Building on results of Halin, Polat and Sabidussi, we identify four
types of subtrees of a scattered tree and a function of the tree into the
integers at least one of which is preserved by every embedding.
With this result and a result of Tyomkyn, we prove that the tree alternative
property conjecture of Bonato and Tardif holds for scattered trees and a
conjecture of Tyomkin holds for locally finite scattered trees
An Algebraic View of the Relation between Largest Common Subtrees and Smallest Common Supertrees
The relationship between two important problems in tree pattern matching, the
largest common subtree and the smallest common supertree problems, is
established by means of simple constructions, which allow one to obtain a
largest common subtree of two trees from a smallest common supertree of them,
and vice versa. These constructions are the same for isomorphic, homeomorphic,
topological, and minor embeddings, they take only time linear in the size of
the trees, and they turn out to have a clear algebraic meaning.Comment: 32 page
Random subgroups of Thompson's group
We consider random subgroups of Thompson's group with respect to two
natural stratifications of the set of all generator subgroups. We find that
the isomorphism classes of subgroups which occur with positive density are not
the same for the two stratifications.
We give the first known examples of {\em persistent} subgroups, whose
isomorphism classes occur with positive density within the set of -generator
subgroups, for all sufficiently large . Additionally, Thompson's group
provides the first example of a group without a generic isomorphism class of
subgroup. Elements of are represented uniquely by reduced pairs of finite
rooted binary trees.
We compute the asymptotic growth rate and a generating function for the
number of reduced pairs of trees, which we show is D-finite and not algebraic.
We then use the asymptotic growth to prove our density results.Comment: 37 pages, 11 figure
- …