论文信息 - On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three

On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three

This paper shows that both the nonseparating independent set problem and feedback set problem can be solved in polynomial time for graphs with no vertex degree exceeding 3 by reducing the problems to the matroid parity problem.

[1] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[2] David S. Johnson,et al. The Rectilinear Steiner Problem is NP-Complete , 1977 .

[3] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[4] David S. Johnson,et al. The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.