Given a graph with n vertices and m edges, does it contain a simple cycle of length ⌈n/2⌉?
I need to prove that the following is NP-complete: Given a graph with n vertices and m edges, does it contain a simple cycle of length ⌈n/2⌉? I'm familiar with the Longest Cycle problem, and I know that a Hamilton Cycle can be reduced to the Longest Cycle problem, but I'm having trouble convincing myself that this is an instance of the Longest Cycle problem. The Longest Cycle problem states that Given a graph and integer k, is there a cycle with no repeated nodes of at least k? My intuition says that I can simply replace k with ⌈n/2⌉ and prove it the same way as Hamilton Cycle ≤ Longest Cycle. But that proof involves "at least k" whereas my problem deal with cycles of a specific value ⌈n/2⌉. Any help would be appreciated.
Prove NP-Completeness of generating 2 shortest routes over given edge grouping constraints?
Reduction to Clique prob
Approximation Algorithm between two NP compete problems
Is it possible to find the probability to a solution of NP-complete problems?
Knapsack for each weight having multiple values - Is it possible to solve?
Reduction from Maximum independent set to Dominating set to prove the Dominating set is NP-complete
How I can prove that 2-CNF is not NP-complete?
When NP complete becomes NP hard
Can it be proven no polynomial algorithm exists for an NP-Complete prob.?
Effect of number base when proving NP completeness of numerical problems
How to reduce 3COLOR to 3SAT?
Proof that Dominating Set is NP-Complete
Is this an NP problem?
Given a collection of consumers competing for a limited resource, allocate that resource to maximize it's applicability
What is the difference between a 'combinatorial algorithm' and a 'linear algorithm'?