On the complexity of the Maximum Subgraph Problem

Authors:
John M. Lewis
Affiliations:
-
Venue:
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Year:
1978

Citing 2
Cited 10

A generalization and proof of the Aanderaa-Rosenberg conjecture

STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Formal languages and their relation to automata

Formal languages and their relation to automata

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

Journal of the ACM (JACM)
Linear-time computability of combinatorial problems on series-parallel graphs

Journal of the ACM (JACM)
SNPs Problems, Complexity, and Algorithms

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Node-and edge-deletion NP-complete problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of uniform Nash equilibria and related regular subgraph problems

Theoretical Computer Science
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties

Journal of Computer and System Sciences
Redundant multicast routing in multilayer networks with shared risk resource groups: Complexity, models and algorithms

Computers and Operations Research
Approximation algorithms for the consecutive ones submatrix problem on sparse matrices

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
A good submatrix is hard to find

Operations Research Letters
Local approximations for maximum partial subgraph problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. This paper studies the complexity of this problem for various properties. The principal result is that if the property is any one of a wide class of monotone properties, the Maximum Subgraph Problem is NP-hard. This suggests a promising direction of inquiry into the P &equil; ?NP question.