Approximating the path-distance-width for AT-free graphs and graphs in related classes

Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki

研究成果: ジャーナルへの寄稿学術誌査読

1 被引用数 (Scopus)

抄録

We consider the problem of determining the path-distance-width for AT-free graphs and graphs in related classes such as k-cocomparability graphs, proper interval graphs, cobipartite graphs, and cochain graphs. We first show that the problem is NP-hard even for cobipartite graphs, and thus for AT-free graphs. Next we present simple approximation algorithms with constant approximation ratios for AT-free graphs and graphs in the related graph classes mentioned above. For instance, our algorithm for AT-free graphs has approximation factor 3 and runs in linear time. We also show that the problem is solvable in polynomial time for cochain graphs, which form a subclass of the class of proper interval graphs.

本文言語英語
ページ(範囲)69-77
ページ数9
ジャーナルDiscrete Applied Mathematics
168
DOI
出版ステータス出版済み - 5月 11 2014

!!!All Science Journal Classification (ASJC) codes

  • 離散数学と組合せ数学
  • 応用数学

フィンガープリント

「Approximating the path-distance-width for AT-free graphs and graphs in related classes」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル