The Leafed Induced Subtree in chordal and bounded treewidth graphs

01/30/2023
by   Julien Baste, et al.
1

In the Fully Leafed Induced Subtrees, one is given a graph G and two integers a and b and the question is to find an induced subtree of G with a vertices and at least b leaves. This problem is known to be NP-complete even when the input graph is 4-regular. Polynomial algorithms are known when the input graph is restricted to be a tree or series-parallel. In this paper we generalize these results by providing an FPT algorithm parameterized by treewidth. We also provide a polynomial algorithm when the input graph is restricted to be a chordal graph.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/18/2019

Metric Dimension Parameterized by Treewidth

A resolving set S of a graph G is a subset of its vertices such that no ...
research
11/25/2019

Graph isomorphism in quasipolynomial time parameterized by treewidth

We extend Babai's quasipolynomial-time graph isomorphism test (STOC 2016...
research
05/27/2018

Distributed Treewidth Computation

Of all the restricted graph families out there, the family of low treewi...
research
11/09/2018

Minimizing and Computing the Inverse Geodesic Length on Trees

The inverse geodesic length (IGL) of a graph G=(V,E) is the sum of inver...
research
06/02/2020

Fast Algorithms for Join Operations on Tree Decompositions

Treewidth is a measure of how tree-like a graph is. It has many importan...
research
03/23/2023

Parameterized Algorithms for Topological Indices in Chemistry

We have developed efficient parameterized algorithms for the enumeration...
research
07/03/2023

A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth

We give a fine-grained classification of evaluating the Tutte polynomial...

Please sign up or login with your details

Forgot password? Click here to reset