Partition-distance: A problem and class of perfect graphs arising in clustering (Q1603544)
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 1767468
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partition-distance: A problem and class of perfect graphs arising in clustering |
scientific article; zbMATH DE number 1767468 |
Statements
Partition-distance: A problem and class of perfect graphs arising in clustering (English)
0 references
14 July 2002
0 references
partitioning
0 references
clustering
0 references
assignment problem
0 references
node cover
0 references
perfect graph
0 references
genetics
0 references
graph algorithms
0 references
combinatorial problems
0 references
0.8046740889549255
0 references
0.7721349000930786
0 references
0.7716962695121765
0 references
0.7473088502883911
0 references
0.7424159646034241
0 references
