ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS (Q3434272): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Anders Dessmark / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Andrzej Lingas / rank | |||
Normal rank | |||
Revision as of 18:36, 12 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS |
scientific article |
Statements
ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS (English)
0 references
25 April 2007
0 references
approximation algorithm
0 references
clustering
0 references
clique partition
0 references
inapproximability
0 references
DNA clone classification
0 references
