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.
|ジャーナル||Journal of the Operations Research Society of Japan|
|出版ステータス||Published - 2000 3|
ASJC Scopus subject areas
- 経営科学およびオペレーションズ リサーチ