DeepAI AI Chat
Log In Sign Up

New Algorithms for Unordered Tree Inclusion

by   Tatsuya Akutsu, et al.
National Institute of Informatics
Kyoto University
The Hong Kong Polytechnic University

The tree inclusion problem is, given two node-labeled trees P and T (the "pattern tree" and the "text tree"), to locate every minimal subtree in T (if any) that can be obtained by applying a sequence of node insertion operations to P. The ordered tree inclusion problem is known to be solvable in polynomial time while the unordered tree inclusion problem is NP-hard. The currently fastest algorithm for the latter is from 1995 and runs in O(poly(m,n) · 2^2d) = O^∗(4^d) time, where m and n are the sizes of the pattern and text trees, respectively, and d is the degree of the pattern tree. Here, we develop a new algorithm that improves the exponent 2d to d by considering a particular type of ancestor-descendant relationships and applying dynamic programming, thus reducing the time complexity to O^∗(2^d). We then study restricted variants of the unordered tree inclusion problem where the number of occurrences of different node labels and/or the input trees' heights are bounded and show that although the problem remains NP-hard in many such cases, if the leaves of P are distinctly labeled and each label occurs at most c times in T then it can be solved in polynomial time for c = 2 and in O^∗(1.8^d) time for c = 3.


page 1

page 2

page 3

page 4


On Maximum Common Subgraph Problems in Series-Parallel Graphs

The complexity of the maximum common connected subgraph problem in parti...

A Space-efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraziation

An NP-hard graph problem may be intractable for general graphs but it co...

Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results

A preference profile is single-peaked on a tree if the candidate set can...

Approximating the Minimum k-Section Width in Bounded-Degree Trees with Linear Diameter

Minimum k-Section denotes the NP-hard problem to partition the vertex se...

A Fully Polynomial Time Approximation Scheme For A NP-Hard Problem

We present a novel feasibility criteria for the intersection of convex s...

On the Complexity of Sub-Tree Scheduling for Wireless Sensor Networks with Partial Coverage

Given an undirected graph G whose edge weights change over s time slots,...

On Optimal Trees for Irregular Gather and Scatter Collectives

This paper studies the complexity of finding cost-optimal communication ...