The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems (Q3854626): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 14:00, 5 March 2024
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
