# np-complete

Topic | Replies | Views | Activity | |
---|---|---|---|---|

How to solve Hamiltonian Path using SAT solver for Undirected Graph? | 12 | 7909 | April 12, 2020 | |

HKNH2018 PROB03-EDITORIAL (Headquarters) | 0 | 506 | October 21, 2018 | |

Given a directed unweighted graph how can we traverse though maximum number of nodes given we can choose any node as the source? | 0 | 2743 | April 2, 2015 | |

If we modify Travelling Salesman problem to allow visit to each node more than once, will it still be NP-Complete? | 0 | 3036 | August 24, 2014 | |

NP-completeness | 2 | 977 | March 20, 2014 |