Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem (Q1926502)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem |
scientific article; zbMATH DE number 6119008
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem |
scientific article; zbMATH DE number 6119008 |
Statements
Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem (English)
0 references
28 December 2012
0 references
maximum clique
0 references
clique partition
0 references
approximation algorithm
0 references
