A sequential algorithm for finding a maximum weight<i>K</i>-independent set on interval graphs (Q2710758): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:04, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sequential algorithm for finding a maximum weight<i>K</i>-independent set on interval graphs |
scientific article |
Statements
A sequential algorithm for finding a maximum weight<i>K</i>-independent set on interval graphs (English)
0 references
19 December 2002
0 references
interval graph
0 references
independent set
0 references
network flow problem
0 references
combinatorial problems
0 references
design of algorithms
0 references
analysis of algorithms
0 references
