Complexity and approximability of extended spanning star forest problems in general and complete graphs (Q2419107)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and approximability of extended spanning star forest problems in general and complete graphs |
scientific article |
Statements
Complexity and approximability of extended spanning star forest problems in general and complete graphs (English)
0 references
29 May 2019
0 references
computational complexity
0 references
parameterized complexity
0 references
approximation algorithms
0 references
graphs
0 references
extended solution
0 references
spanning star forest
0 references
0 references
0 references
