| 作成者 |
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
This is a survey on complexity issues of subgraph problems proved in a systematic way. We deal with vertex-deletion and edge-deletion problems which can be viewed as subgraph problems. General NP-comp...leteness theorems are presernted for these problems. We also present a systematized result which shoaws polynomial time algorithms for these problems restricted to series-parallel graphs. Another problem we consider in this paper is the lelxicographically first maximal subgraph problems which appear in connection with parallel complexity theory.続きを見る
|
Mendeley出力
rifis-tr-25