On the Parallel Parameterized Complexity of the Graph Isomorphism Problem

11/24/2017
by   Bireswar Das, et al.
0

In this paper, we study the parallel and the space complexity of the graph isomorphism problem () for several parameterizations. Let H={H_1,H_2,...,H_l} be a finite set of graphs where |V(H_i)|≤ d for all i and for some constant d. Let G be an H-free graph class i.e., none of the graphs G∈G contain any H ∈H as an induced subgraph. We show that parameterized by vertex deletion distance to G is in a parameterized version of ^1, denoted -^1, provided the colored graph isomorphism problem for graphs in G is in ^1. From this, we deduce that parameterized by the vertex deletion distance to cographs is in -^1. The parallel parameterized complexity of parameterized by the size of a feedback vertex set remains an open problem. Towards this direction we show that the graph isomorphism problem is in -^0 when parameterized by vertex cover or by twin-cover. Let G' be a graph class such that recognizing graphs from G' and the colored version of for G' is in logspace (Ł). We show that for bounded vertex deletion distance to G' is in Ł. From this, we obtain logspace algorithms for for graphs with bounded vertex deletion distance to interval graphs and graphs with bounded vertex deletion distance to cographs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/19/2020

Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies

We consider the Π-free Deletion problem parameterized by the size of a v...
research
07/14/2022

Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes

Let ℱ be a family of graphs, and let p,r be nonnegative integers. The (p...
research
09/01/2022

Minimally tough chordal graphs with toughness at most 1/2

Let t be a positive real number. A graph is called t-tough if the remova...
research
05/10/2021

Parameterized Complexity of Deletion to Scattered Graph Classes

Graph-modification problems, where we add/delete a small number of verti...
research
11/04/2022

A Framework for Approximation Schemes on Disk Graphs

We initiate a systematic study of approximation schemes for fundamental ...
research
03/19/2018

Parameterized complexity of fair deletion problems II

Vertex deletion problems are those where given a graph G and a graph pro...
research
05/04/2020

On the Parameterized Complexity of Deletion to H-free Strong Components

Directed Feedback Vertex Set (DFVS) is a fundamental computational prob...

Please sign up or login with your details

Forgot password? Click here to reset