For a graph with n vertices, how can I find a k-vertex independent set? (Actually, it doesn’t have to be a polynomial-time algorithm, as long as it runs in reasonable time for n = 200, k = 10.)
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
For a graph with n vertices, how can I find a k-vertex independent set? (Actually, it doesn’t have to be a polynomial-time algorithm, as long as it runs in reasonable time for n = 200, k = 10.)
This is a NP hard problem if k isn’t fixed. If k is fixed, it is trivially polynomial. Also, you’re better off asking on one of the other overflow sites for pure algorithmic questions.
As for practical algorithms, what have you tried already? It’s possible that even something as simple as greedy search will work with a small problem size.