Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q115577869, #quickstatements; #temporary_batch_1707303357582 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q115577869 / rank | |||
Normal rank | |||
Revision as of 13:37, 7 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Moderately exponential time algorithms for the maximum bounded-degree-1 set problem |
scientific article |
Statements
Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (English)
0 references
3 December 2018
0 references
bounded-degree-1 set
0 references
2-plex
0 references
vertex cover P3
0 references
exact algorithm
0 references
approximation algorithm
0 references
