An efficient algorithm for finding a maximum weight 2-independent set on interval graphs (Q1199945)
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: An efficient algorithm for finding a maximum weight 2-independent set on interval graphs |
scientific article; zbMATH DE number 96284
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for finding a maximum weight 2-independent set on interval graphs |
scientific article; zbMATH DE number 96284 |
Statements
An efficient algorithm for finding a maximum weight 2-independent set on interval graphs (English)
0 references
17 January 1993
0 references
maximum weight \(k\)-independent set problem
0 references
algorithm
0 references
maximum weight independent set problem
0 references
maximum weight 2-independent set problem
0 references
interval graph
0 references
0 references
0.8505521416664124
0 references
0.8200575709342957
0 references
0.8172293305397034
0 references
0.8028472661972046
0 references
0.7969509959220886
0 references
