Partition-distance: A problem and class of perfect graphs arising in clustering (Q1603544): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 06:03, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partition-distance: A problem and class of perfect graphs arising in clustering |
scientific article |
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
