News for hackers. Stuff that matters.
Re:NP-Complete isn't (always) Hard by yarg on Friday February 24, 2023 @03:04PM (#34929362)
It's not the travelling salesman - as per the description it's an unweighted graph.

This reduces the problem from finding the shortest hamiltonian cycle to finding any such cycle.

There are no comments on this comment yet.