Math Is Fun Forum
  Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

#1 Coder's Corner » k-Colorability Reduction » 2010-10-26 19:44:31

kadixt
Replies: 0

Hi everyone,

I'm having trouble reducing a k-Colorability problem to an Exact Cover problem (NP problems).
I've got an algorithm that can do it for k=2, but does anyone know of a way to reduce for k>=3?
I've searched far and wide on Google, Bing etc but can't find anything.

Would really appreciated any advice!!

Cheers,

Nelson

Board footer

Powered by FluxBB