Extraordinary_'s blog

Clique cover.
By Extraordinary_, history, 3 years ago, translation, In English

Such a question is ripe. There is a graph. It is required to cover all the edges of the graph with the minimum number of cliques.

IMPORTANT: each edge is EXACTLY in one click.

Example: Graph edges: (1, 2), (1, 3), (2, 3), (3, 4), (2, 4). Output: 3.

I tried googling, but couldn't find anything.

Who can prove complexity class, I will be grateful!

  • Vote: I like it
  • -4
  • Vote: I do not like it

»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been translated by Extraordinary_ (original revision, translated revision, compare)

→ Reply
»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by Extraordinary_ (previous revision, new revision, compare).

→ Reply