Skip to main content

New answers tagged

1 vote

Reducing the Independent Set Problem to Independent Set for 3-Colorable Graphs

The independent set problem for 3-colorable graphs has been discussed here. More specifically, the link discusses the hardness of the maximum independent set problem and the 3-colorability problem. ...
codeR's user avatar
  • 1,271

Top 50 recent answers are included