An efficient algorithm for finding a maximum weight 2-independent set on interval graphs (Q1199945): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Ju-Yuan Hsiao / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Ruay-Shiung Chang / rank | |||
Normal rank | |||
Revision as of 16:55, 12 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for finding a maximum weight 2-independent set on interval graphs |
scientific article |
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
