clique_problem (529B)
1 # Clique problem 2 3 The [computational_problem] of finding a [clique] in an input [graph] 4 5 Also: 6 - subgraph with the largest proportion of edges ([np_hard] for the same reason), 7 - [densest_subgraph]: subgraph of maximal density (#edges/#vertices) which is [ptime] and reducible to [network_flow] 8 9 - [4_clique_hypothesis] 10 - [k_clique_hypothesis] 11 12 Up: [graph_problem] of finding [clique] 13 14 See also: [clique_listing], [hyperclique_detection], [hyperclique_conjecture], [cycle_problem], [triangle_detection] 15 16 Aliases: k clique problem