Skip to main content
Computer Science

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

4
  • $\begingroup$ This is not the (implied) reduction asked in the question. I am looking for SI --to --> HC reduction. Not otherway around. Even a reduction to SAT from SI would be helpful (using Cook-Levin Theorem) $\endgroup$ Commented Jun 14, 2024 at 23:02
  • $\begingroup$ Well, SI is a generalization of HC, so it is a proof of the NP-hardness of SI. $\endgroup$ Commented Jun 15, 2024 at 5:09
  • $\begingroup$ Yes, but that was not my question. Your "answer" is well known!I have a P-time solution to HC. If I can find an existing reduction of SI--> HC, then I could solve SI too. The only other way is to go through the long path of SI--> SAT --> HC. And even SI--> SAT is not known. $\endgroup$ Commented Jun 15, 2024 at 17:25
  • $\begingroup$ I see... you have a polynomial time algorithm for Hamiltonian Cycle and need one for Subgraph Isomorphism? $\endgroup$ Commented Jun 15, 2024 at 21:04