Partition-distance: A problem and class of perfect graphs arising in clustering (Q1603544): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0190(01)00263-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1996134775 / rank | |||
Normal rank | |||
Latest revision as of 09:58, 30 July 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
