The generalized stable set problem for claw-free bidirected graphs

Daishin Nakamura, Akihisa Tamura

研究成果: Conference contribution

3 被引用数 (Scopus)

抄録

Bidirected graphs are a generalization of undirected graphs. The generalized stable set problem is an extension of the maximum weight stable set problem for undirected graphs to bidirected graphs. It is known that the latter problem is polynomially solvable for claw-free undirected graphs. In this paper, we define claw-free bidirected graphs and show that the generalized stable set problem is also polynomially solvable for claw-free bidirected graphs.

本文言語English
ホスト出版物のタイトルLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
出版社Springer Verlag
ページ69-83
ページ数15
1412
ISBN(印刷版)354064590X, 9783540645900
DOI
出版ステータスPublished - 1998
外部発表はい
イベント6th International Integer Programming and Combinatorial Optimization Conference, IPCO 1998 - Houston, United States
継続期間: 1998 6 221998 6 24

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
1412
ISSN(印刷版)03029743
ISSN(電子版)16113349

Other

Other6th International Integer Programming and Combinatorial Optimization Conference, IPCO 1998
国/地域United States
CityHouston
Period98/6/2298/6/24

ASJC Scopus subject areas

  • コンピュータ サイエンス(全般)
  • 理論的コンピュータサイエンス

フィンガープリント

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

引用スタイル