A linear time algorithm for the generalized stable set problem on triangulated bidirected graphs

Daishin Nakamura, Akihisa Tamura

研究成果: Article査読

抄録

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.

本文言語English
ページ(範囲)162-175
ページ数14
ジャーナルJournal of the Operations Research Society of Japan
43
1
DOI
出版ステータスPublished - 2000 3
外部発表はい

ASJC Scopus subject areas

  • 決定科学(全般)
  • 経営科学およびオペレーションズ リサーチ

フィンガープリント

「A linear time algorithm for the generalized stable set problem on triangulated bidirected graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル