Node-and edge-deletion NP-complete problems

  title={Node-and edge-deletion NP-complete problems},
  author={Mihalis Yannakakis},
  journal={Proceedings of the tenth annual ACM symposium on Theory of computing},
  • M. Yannakakis
  • Published 1 May 1978
  • Mathematics, Computer Science
  • Proceedings of the tenth annual ACM symposium on Theory of computing
If &pgr; is a graph property, the general node(edge) deletion problem can be stated as follows: Find the minimum number of nodes(edges), whose deletion results in a subgraph satisfying property &pgr;. In this paper we show that if &pgr; belongs to a rather broad class of properties (the class of properties that are hereditary on induced subgraphs) then the node-deletion problem is NP-complete, and the same is true for several restrictions of it. For the same class of properties, requiring the… 

Figures from this paper

Edge-Deletion Problems

This paper shows that the edge-deletion problem is NP-complete for the following properties: (1) without cycles of specified length l, or of any length $ \leqq l$, (2) connected and degree-constrained, (3) outerplanar, (4) transitive digraph, (5) line-invertible, (6) bipartite, (7)transitively orientable.

Edge-deletion and edge-contraction problems

It is shown that the edge-deletion problem PED (-&-pgr;) (edge-contraction problem PEC (--p gr;), resp.

Parallel Algorithms for Maximal Acyclic Sets

  • Zhi-Zhong ChenXin He
  • Mathematics, Computer Science
    Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
  • 1995
NC algorithms for solving the problem of finding a maximal subset F of edges in G such that the subgraph induced by F is acyclic are presented and it is shown that the problem is solvable in NC if the input graph G has only vertex-induced paths of length polylogarithmic in the number of vertices of G.

The complexity of some edge deletion problems

Previous complexity results are extended by showing that the EDP corresponding to any class H of graphs in each of the following cases is NP-hard.

Matroids, Complexity and Computation

The hierarchy of all matroid descriptions is created and studied and generalize this to all descriptions of countable objects and shows that it is #P-complete to count the number of bases of matroids representable over any infinite fixed field or finite fields of a fixed characteristic.

Edge Deletion to Restrict the Size of an Epidemic

It is proved that the Th+1-Free Edge Deletion problem is fixed-parameter tractable (FPT) when parameterized by the vertex cover number and that it admits a kernel with O(hk) vertices and O( hk) edges, when parameterizing by combined parameters h and the solution size k.

Strong Parameterized Deletion: Bipartite Graphs

This paper studies Strong Bipartite Deletion, where given an undirected graph G and positive integers k and l, the objective is to check whether there exists a vertex subset S of size at most k such that each connected component of G-S can be made bipartite by deleting at most l edges.

Parameterized complexity of fair deletion problems II

It is proved that the FairVC problem is W[1]-hard with parameterization by both treedepth and feedback vertex set of the input graph and an FPT algorithm is provided for the Fair Vertex Cover problem parameterized by modular width.

Edge-Contraction Problems




Node-Deletion NP-Complete Problems

These 17 different node-deletion problems are shown to be NP-complete and a unified approach is taken for the transformations employed in the proofs.

The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems

It is shown that for the same class of properties the connected maximum subgraph problem is also NP-hard, moreover, for a certain important subclass of properties, even approximating the node-deletion version of it in any "reasonable" way is NP- hard.

Some Simplified NP-Complete Graph Problems

On the complexity of the Maximum Subgraph Problem

For a fixed graph property, the Maximum Subgraph Recognition Problem for the property is: Given a graph G and integer k, does G have a subgraph induced by k vertices which satisfies the property.

Testing graph connectivity

An algorithm proposed by Dinic for finding maximum flows in networks and by Hopcroft and Karp for finding maximum bipartite matchings is applied to graph connectivity problems. It is shown that the

Paths, Trees, and Flowers

  • J. Edmonds
  • Mathematics
    Canadian Journal of Mathematics
  • 1965
A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertices, called the end-points of the edge. An

Depth-First Search and Linear Graph Algorithms

The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components

Approximation algorithms for combinatorial problems

For the problem of finding the maximum clique in a graph, no algorithm has been found for which the ratio does not grow at least as fast as 0(nε), where n is the problem size and ε> 0 depends on the algorithm.

Computers and Intractability: A Guide to the Theory of NP-Completeness

It is proved here that the number ofrules in any irredundant Horn knowledge base involving n propositional variables is at most n 0 1 times the minimum possible number of rules.

Some polynomial and integer divisibility problems are NP-HARD

  • D. Plaisted
  • Mathematics
    17th Annual Symposium on Foundations of Computer Science (sfcs 1976)
  • 1976
The author shows that certain problems involving sparse polynomials and integers are NP-hard and many related problems are alsoNP-hard, and introduces a class of NP- hard and NP-complete problems different from those known previously.