61 research outputs found
On the Threshold of Intractability
We study the computational complexity of the graph modification problems
Threshold Editing and Chain Editing, adding and deleting as few edges as
possible to transform the input into a threshold (or chain) graph. In this
article, we show that both problems are NP-complete, resolving a conjecture by
Natanzon, Shamir, and Sharan (Discrete Applied Mathematics, 113(1):109--128,
2001). On the positive side, we show the problem admits a quadratic vertex
kernel. Furthermore, we give a subexponential time parameterized algorithm
solving Threshold Editing in time,
making it one of relatively few natural problems in this complexity class on
general graphs. These results are of broader interest to the field of social
network analysis, where recent work of Brandes (ISAAC, 2014) posits that the
minimum edit distance to a threshold graph gives a good measure of consistency
for node centralities. Finally, we show that all our positive results extend to
the related problem of Chain Editing, as well as the completion and deletion
variants of both problems
A survey of parameterized algorithms and the complexity of edge modification
The survey is a comprehensive overview of the developing area of parameterized algorithms for graph modification problems. It describes state of the art in kernelization, subexponential algorithms, and parameterized complexity of graph modification. The main focus is on edge modification problems, where the task is to change some adjacencies in a graph to satisfy some required properties. To facilitate further research, we list many open problems in the area.publishedVersio
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs
There has been intensive work on the parameterized complexity of the typically NP-hard task to edit undirected graphs into graphs fulfilling certain given vertex degree constraints. In this work, we lift the investigations to the case of directed graphs; herein, we focus on arc insertions. To this end, our general two-stage framework consists of efficiently solving a problem-specific number problem transferring its solution to a solution for the graph problem by applying flow computations. In this way, we obtain fixed-parameter tractability and polynomial kernelizability results, with the central parameter being the maximum vertex in- or outdegree of the output digraph. Although there are certain similarities with the much better studied undirected case, the flow computation used in the directed case seems not to work for the undirected case while f-factor computations as used in the undirected case seem not to work for the directed case
Graph editing problems with extended regularity constraints
© 2017 Graph editing problems offer an interesting perspective on sub- and supergraph identification problems for a large variety of target properties. They have also attracted significant attention in recent years, particularly in the area of parameterized complexity as the problems have rich parameter ecologies. In this paper we examine generalisations of the notion of editing a graph to obtain a regular subgraph. In particular we extend the notion of regularity to include two variants of edge-regularity along with the unifying constraint of strong regularity. We present a number of results, with the central observation that these problems retain the general complexity profile of their regularity-based inspiration: when the number of edits k and the maximum degree r are taken together as a combined parameter, the problems are tractable (i.e. in FPT), but are otherwise intractable. We also examine variants of the basic editing to obtain a regular subgraph problem from the perspective of parameterizing by the treewidth of the input graph. In this case the treewidth of the input graph essentially becomes a limiting parameter on the natural k+r parameterization
Graph editing to a given degree sequence
We investigate the parameterized complexity of the graph editing problem called Editing to a Graph with a Given Degree Sequence where the aim is to obtain a graph with a given degree sequence ÏÏ by at most k vertex or edge deletions and edge additions. We show that the problem is W[1]-hard when parameterized by k for any combination of the allowed editing operations. From the positive side, we show that the problem can be solved in time 2O(k(Î+k)2)n2logn2O(k(Î+k)2)n2logâĄn for n-vertex graphs, where Î=maxÏÎ=maxÏ, i.e., the problem is FPT when parameterized by k+Îk+Î. We also show that Editing to a Graph with a Given Degree Sequence has a polynomial kernel when parameterized by k+Îk+Î if only edge additions are allowed, and there is no polynomial kernel unless NPâcoNP/polyNPâcoNP/poly for all other combinations of allowed editing operations
Graph editing to a given degree sequence
We investigate the parameterized complexity of the graph editing problem called Editing to a Graph with a Given Degree Sequence where the aim is to obtain a graph with a given degree sequence Ï by at most k vertex deletions, edge deletions and edge additions. We show that the problem is W[1]-hard when parameterized by k for any combination of the allowed editing operations. From the positive side, we show that the problem can be solved in time 2O(k(Îâ+k)2)n2logâĄn for n -vertex graphs, where Îâ=maxâĄÏ, i.e., the problem is FPT when parameterized by k+Îâ. We also show that Editing to a Graph with a Given Degree Sequence has a polynomial kernel when parameterized by k+Îâ if only edge additions are allowed, and there is no polynomial kernel unless NPâco-NP/poly for all other combinations of the allowed editing operations
- âŠ