A polynomial algorithm for the k-cluster problem on the interval graphs (Q3439650)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5158471
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial algorithm for the k-cluster problem on the interval graphs |
scientific article; zbMATH DE number 5158471 |
Statements
A polynomial algorithm for the k-cluster problem on the interval graphs (English)
0 references
29 May 2007
0 references
interval graph
0 references
proper interval graph
0 references
matrix representation
0 references
polynomial algorithm
0 references
dynamic programming
0 references
0 references
0.8028106689453125
0 references
0.796741783618927
0 references
0.785556435585022
0 references
0.7855139970779419
0 references
