Abstract
The generalized stable set problem is an extension of the maximum weight stable set problem for undirected graphs to bidirected graphs. This paper shows that the problem on triangulated bidirected graphs is solvable in linear time. We also propose an exact branch and bound algorithm for the general problem by applying the linear time algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have