The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems (Q3854626): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q129991798, #quickstatements; #temporary_batch_1729681920349 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/322154.322157 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2051937719 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129991798 / rank | |||
Normal rank | |||
Latest revision as of 13:21, 23 October 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
