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.
| Original language | English |
|---|---|
| Pages (from-to) | 162-175 |
| Number of pages | 14 |
| Journal | Journal of the Operations Research Society of Japan |
| Volume | 43 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2000 Mar |
| Externally published | Yes |
ASJC Scopus subject areas
- Decision Sciences(all)
- Management Science and Operations Research