|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/10303
|
| タイトル: | Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem |
| 著者: | Okamoto, Yoshio
Otachi, Yota
Uehara, Ryuhei
Uno, Takeaki |
| キーワード: | Spanning tree congestion
computational complexity
exponential time algorithm |
| 発行日: | 2011-10 |
| 出版者: | Journal of Graph Algorithms and Applications |
| 誌名: | Journal of Graph Algorithms and Applications |
| 巻: | 15 |
| 号: | 6 |
| 開始ページ: | 727 |
| 終了ページ: | 751 |
| 抄録: | Spanning tree congestion is a relatively new graph parameter, which has been studied intensively. This paper studies the complexity of the problem to determine the spanning tree congestion for non-sparse graph classes, while it was investigated for some sparse graph classes before. We prove that the problem is NP-hard even for chain graphs and split graphs. To cope with the hardness of the problem, we present a fast (exponentialtime) exact algorithm that runs in O^*(2^n) time, where n denotes the number of vertices. Additionally, we present simple combinatorial lemmas, which yield a constant-factor approximation algorithm for cographs, and a linear-time algorithm for chordal cographs. |
| Rights: | Copyright (C) 2011 Journal of Graph Algorithms and Applications. Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, and Takeaki Uno, Journal of Graph Algorithms and Applications, 15(6), 2011, 727-751. |
| URI: | http://hdl.handle.net/10119/10303 |
| 資料タイプ: | publisher |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 17641.pdf | | 336Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
