Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} |
scientific article |
Statements
Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (English)
0 references
21 January 2015
0 references
maximum \(k\)-vertex problem
0 references
exact exponential algorithms
0 references
measure-and-conquer
0 references
0 references