A sequential algorithm for finding a maximum weight<i>K</i>-independent set on interval graphs (Q2710758): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207169608804486 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2111523610 / rank | |||
Normal rank | |||
Revision as of 20:29, 19 March 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
