Maximum weight<i>k</i>-independent set problem on permutation graphs (Q4467342)
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 weightk-independent set problem on permutation graphs |
scientific article; zbMATH DE number 2071075
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum weight<i>k</i>-independent set problem on permutation graphs |
scientific article; zbMATH DE number 2071075 |
Statements
Maximum weight<i>k</i>-independent set problem on permutation graphs (English)
0 references
9 June 2004
0 references
network flow problem
0 references
design of algorithms
0 references
0 references
0 references
0 references
0 references
0.9016559720039368
0 references
0.9005839824676514
0 references
0.8988431692123413
0 references
