Finding Optimal Solutions With Neighborly Help

by   Elisabet Burjons, et al.

Can we efficiently compute optimal solutions to instances of a hard problem from optimal solutions to neighboring (i.e., locally modified) instances? For example, can we efficiently compute an optimal coloring for a graph from optimal colorings for all one-edge-deleted subgraphs? Studying such questions not only gives detailed insight into the structure of the problem itself, but also into the complexity of related problems; most notably graph theory's core notion of critical graphs (e.g., graphs whose chromatic number decreases under deletion of an arbitrary edge) and the complexity-theoretic notion of minimality problems (also called criticality problems, e.g., recognizing graphs that become 3-colorable when an arbitrary edge is deleted). We focus on two prototypical graph problems, Colorability and Vertex Cover. For example, we show that it is NP-hard to compute an optimal coloring for a graph from optimal colorings for all its one-vertex-deleted subgraphs, and that this remains true even when optimal solutions for all one-edge-deleted subgraphs are given. In contrast, computing an optimal coloring from all (or even just two) one-edge-added supergraphs is in P. We observe that Vertex Cover exhibits a remarkably different behavior, demonstrating the power of our model to delineate problems from each other more precisely on a structural level. Moreover, we provide a number of new complexity results for minimality and criticality problems. For example, we prove that Minimal-3-UnColorability is complete for DP (differences of NP sets), which was previously known only for the more amenable case of deleting vertices rather than edges. For Vertex Cover, we show that recognizing beta-vertex-critical graphs is complete for Theta_2^p (parallel access to NP), obtaining the first completeness result for a criticality problem for this class.


page 1

page 2

page 3

page 4


Parameterized and Exact Algorithms for Class Domination Coloring

A class domination coloring (also called cd-Coloring or dominated colori...

Parameterized complexity of edge-coloured and signed graph homomorphism problems

We study the complexity of graph modification problems for homomorphism-...

Reoptimization of Path Vertex Cover Problem

Most optimization problems are notoriously hard. Considerable efforts mu...

Parameterised distance to local irregularity

A graph G is locally irregular if no two of its adjacent vertices have t...

Complexity of Modification Problems for Reciprocal Best Match Graphs

Reciprocal best match graphs (RBMGs) are vertex colored graphs whose ver...

Time-inconsistent Planning: Simple Motivation Is Hard to Find

With the introduction of the graph-theoretic time-inconsistent planning ...

Finding temporal patterns using algebraic fingerprints

In this paper we study a family of pattern-detection problems in vertex-...

Please sign up or login with your details

Forgot password? Click here to reset