| 作成者 |
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
The lerrtcographically first maximal (lfm) induced path problem is shown $ Delta ^p_2 $- complete. The lfm rooted tree problem is also analyzed. This problem is $ Delta^p_2 $- complete, But when restr...icted to topologically sorted directed acyclic graphs (dags), it allows a polynomial time algorithm. &Moreover, the problem restricted to topologically sorted Bags with degree 3 is shown in $ NC^2 $ while the problem for degree 4 is P-complete.続きを見る
|
Mendeley出力
rifis-tr-1