<テクニカルレポート>
Systematized Approaches to the Complexity of Subgraph Problems

作成者
本文言語
出版者
発行日
雑誌名
出版タイプ
アクセス権
概要 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.続きを見る

本文情報を非表示

rifis-tr-25 pdf 1.98 MB 84  

詳細

レコードID
査読有無
関連情報
注記
タイプ
登録日 2009.04.22
更新日 2017.01.20