The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems (Q3854626)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems |
scientific article |
Statements
The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems (English)
0 references
1979
0 references
induced subgraph
0 references
NP-hard
0 references
hereditary property
0 references
NP-complete
0 references
approximation
0 references
polynomial hierarchy
0 references
connected maximum subgraph problem
0 references
node-deletion problem
0 references
