Maximum weight <i>t</i>-sparse set problem on vector-weighted graphs (Q6140983)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Maximum weight t-sparse set problem on vector-weighted graphs |
scientific article; zbMATH DE number 7792464
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum weight <i>t</i>-sparse set problem on vector-weighted graphs |
scientific article; zbMATH DE number 7792464 |
Statements
Maximum weight <i>t</i>-sparse set problem on vector-weighted graphs (English)
0 references
22 January 2024
0 references
outerplane graphs
0 references
treewidth
0 references
vector weights
0 references
\(t\)-sparse sets
0 references
maximum weight
0 references
0 references
0 references
0 references
0 references
