Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable

09/28/2017
by   V. Arvind, et al.
0

Lubiw showed that several variants of Graph Isomorphism are NP-complete, where the solutions are required to satisfy certain additional constraints [SICOMP 10, 1981]. One of these, called Isomorphism With Restrictions, is to decide for two given graphs X_1=(V,E_1) and X_2=(V,E_2) and a subset R⊆ V× V of forbidden pairs whether there is an isomorphism π from X_1 to X_2 such that π(i)≠ j for all (i,j)∈ R. We prove that this problem and several of its generalizations are in fact in FPT: - The problem of deciding whether there is an isomorphism between two graphs that moves k vertices and satisfies Lubiw-style constraints is in FPT, with k and the size of R as parameters. The problem remains in FPT if a CNF of such constraints is allowed. It follows that the problem to decide whether there is an isomorphism that moves exactly k vertices is in FPT. This solves a question left open in our article on exact weight automorphisms [STACS 2017]. - When the weight and complexity are unrestricted, finding isomorphisms that satisfy a CNF of Lubiw-style constraints can be solved in FPT with access to a GI oracle. - Checking if there is an isomorphism π between two graphs with complexity t is also in FPT with t as parameter, where the complexity of a permutation is the Cayley measure defined as the minimum number t such that π can be expressed as a product of t transpositions. - We consider a more general problem in which the vertex set of a graph X is partitioned into Red and Blue, and we are interested in an automorphism that stabilizes Red and Blue and moves exactly k vertices in Blue, where k is the parameter. This problem was introduced by [Downey and Fellows 1999], and we showed [STACS 2017] that it is W[1]-hard even with color classes of size 4 inside Red. Now, for color classes of size at most 3 inside Red, we show the problem is in FPT.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/15/2022

The RED-BLUE SEPARATION problem on graphs

We introduce the Red-Blue Separation problem on graphs, where we are giv...
research
09/24/2018

The Balanced Connected Subgraph Problem

The problem of computing induced subgraphs that satisfy some specified r...
research
03/24/2021

The Multicolored Graph Realization Problem

We introduce the Multicolored Graph Realization problem (MGRP). The inpu...
research
07/22/2021

Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable

It is known that testing isomorphism of chordal graphs is as hard as the...
research
02/24/2022

Exact Matching in Graphs of Bounded Independence Number

In the Exact Matching Problem (EM), we are given a graph equipped with a...
research
11/02/2018

A simplified disproof of Beck's three permutations conjecture and an application to root-mean-squared discrepancy

A k-permutation family on n vertices is a set system consisting of the i...
research
06/30/2023

Off-Diagonal Ramsey Multiplicity

The Ramsey multiplicity problem asks for the minimum asymptotic density ...

Please sign up or login with your details

Forgot password? Click here to reset