Abstract
It is shown that the well-known independent set problem remains NP-complete even when restricted to graphs which contain no cycles of length less than cn k where n is the number of vertices in the graph, and c and k are constants satisfying c >0 and 0≤ k <1. A polynomial time approximation algorithm for this problem is also examined.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
