Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865)
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: Exact algorithms for problems related to the densest k-set problem |
scientific article; zbMATH DE number 6291957
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact algorithms for problems related to the densest \(k\)-set problem |
scientific article; zbMATH DE number 6291957 |
Statements
Exact algorithms for problems related to the densest \(k\)-set problem (English)
0 references
5 May 2014
0 references
densest (sparsest) \(k\)-set
0 references
minimum (maximum) \(k\)-vertex cover
0 references
partial vertex cover
0 references
exact algorithm
0 references
design of algorithms
0 references
0.91137946
0 references
0.9070495
0 references
0.90343577
0 references
0.9009783
0 references
0.8995054
0 references
0.8987745
0 references
0.8965757
0 references
0.8926902
0 references
0 references
