<学術雑誌論文>
Polynomial Time Algorithm Solving the Refutation Tree Problem for Formal Graph Systems

作成者
本文言語
出版者
発行日
雑誌名
開始ページ
終了ページ
出版タイプ
アクセス権
概要 The refutation tree problem for a formal graph system (FGS) is to compute a refutation tree which represents the logical structure of a graph generated by the FGS. We present three subclasses of FGSs:... simple FGSs, size-bounded simple FGSs, and bounded simple FGSs. We give a polynomial-time algorithm solving the refutation tree problem for simple FGSs. For sizebounded simple FGSs generating undirected trees of constantly bounded valence, we show that a refutation tree of a graph definable by the FGS can be computed in NC^2. Moreover, we indicate that the refutation tree problem for bounded simple FGSs is in NC^2.続きを見る

本文情報を非表示

75.ps tgz 213 KB 4 RIFIS Technical Report
75.ps.tar pdf 264 KB 36 RIFIS Technical Report
p055 pdf 1.17 MB 59 Bulletin of Informatics and Cybernetics

詳細

レコードID
査読有無
関連情報
ISSN
NCID
登録日 2009.04.22
更新日 2017.01.20