Browsing University of Waterloo by Subject "NP Hardness"
Now showing items 1-1 of 1
-
The Complexity of Finding Dense Subgraphs in Graphs with Large Cliques
(University of Waterloo, 2021-08-25)The GapDensest-k-Subgraph(d) problem (GapDkS(d)) is defined as follows: given a graph G and parameters k,d, distinguish between the case that G contains a k-clique, and the case that every k-subgraph of G has density at ...