Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2018.05.032 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2018.05.032 / rank | |||
Normal rank | |||
Latest revision as of 23:34, 10 December 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
0 references
0 references
0 references
0 references
0 references
