Complexity and inapproximability results for balanced connected subgraph problem (Q2232593)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and inapproximability results for balanced connected subgraph problem |
scientific article |
Statements
Complexity and inapproximability results for balanced connected subgraph problem (English)
0 references
6 October 2021
0 references
complexity
0 references
approximation
0 references
color-balanced subgraph
0 references
0 references
0 references
