The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Node-and edge-deletion NP-complete problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Complexity Classification of Some Edge Modification Problems
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Additive Approximation for Edge-Deletion Problems
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Hardness of edge-modification problems
Theoretical Computer Science
On the complexity of some subgraph problems
Discrete Applied Mathematics
| Hi-index | 0.01 |
For a property -&-pgr; on graphs, the corresponding edge-deletion problem PED(-&-pgr;) (edge-contraction problem PEC(-&-pgr;), resp.) is defined as follows: Given a graph G, find a set of edges of minimum cardinality whose deletion (contraction, resp.) results in a graph satisfying property -&-pgr;. In this paper we show that the edge-deletion problem PED (-&-pgr;) (edge-contraction problem PEC (-&-pgr;), resp.) is NP-hard if -&-pgr; is hereditary on subgraphs (contractions, resp.) and is determined by the 3-connected components.