Subexponential-time algorithms for finding large induced sparse subgraphs

10/02/2019
by   Jana Novotná, et al.
0

Let C and D be hereditary graph classes. Consider the following problem: given a graph G∈D, find a largest, in terms of the number of vertices, induced subgraph of G that belongs to C. We prove that it can be solved in 2^o(n) time, where n is the number of vertices of G, if the following conditions are satisfied: * the graphs in C are sparse, i.e., they have linearly many edges in terms of the number of vertices; * the graphs in D admit balanced separators of size governed by their density, e.g., O(Δ) or O(√(m)), where Δ and m denote the maximum degree and the number of edges, respectively; and * the considered problem admits a single-exponential fixed-parameter algorithm when parameterized by the treewidth of the input graph. This leads, for example, to the following corollaries for specific classes C and D: * a largest induced forest in a P_t-free graph can be found in 2^Õ(n^2/3) time, for every fixed t; and * a largest induced planar graph in a string graph can be found in 2^Õ(n^3/4) time.

READ FULL TEXT

page 1

page 3

page 5

page 7

page 9

page 11

research
04/20/2020

Finding large H-colorable subgraphs in hereditary graph classes

We study the Max Partial H-Coloring problem: given a graph G, find the l...
research
09/12/2017

Induced 2-degenerate Subgraphs of Triangle-free Planar Graphs

A graph is k-degenerate if every subgraph has minimum degree at most k. ...
research
09/23/2021

Partitioning an interval graph into subgraphs with small claws

The claw number of a graph G is the largest number v such that K_1,v is ...
research
06/29/2022

Recognizing Map Graphs of Bounded Treewidth

A map graph is a graph admitting a representation in which vertices are ...
research
10/04/2018

Parameterized Leaf Power Recognition via Embedding into Graph Products

The k-leaf power graph G of a tree T is a graph whose vertices are the l...
research
03/29/2023

On Hypergraph Supports

Let ℋ=(X,ℰ) be a hypergraph. A support is a graph Q on X such that for e...
research
02/28/2018

Parameterized Aspects of Strong Subgraph Closure

Motivated by the role of triadic closures in social networks, and the im...

Please sign up or login with your details

Forgot password? Click here to reset