A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs (Q264186)
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: A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs |
scientific article; zbMATH DE number 6563698
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs |
scientific article; zbMATH DE number 6563698 |
Statements
A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs (English)
0 references
6 April 2016
0 references
maximum weight independent set
0 references
cocomparability graphs
0 references
posets
0 references
minimum weight vertex cover
0 references
0 references
0 references
0.7972263693809509
0 references
0.7949339151382446
0 references
0.7932599782943726
0 references
0.792489230632782
0 references
0.7812937498092651
0 references
