A New Series of $Delta^{p}_{2}$ -Complete Problemse - Collections

＜technical report＞
A New Series of $Delta^{p}_{2}$ -Complete Problemse

Creator	Author PID L001145 Creator Name Miyano, Satoru 宮野, 悟 Affiliation Affiliation Name Research Institute of Fundamental Information Science Kyushu University 九州大学理学部附属基礎情報学研究施設
Language	English
Publisher	Research Institute of Fundamental Information Science, Kyushu University
Publisher	九州大学理学部附属基礎情報学研究施設
Date	1989-07-10
Source Title	RIFIS Technical Report
Vol	16
Publication Type	Accepted Manuscript
Access Rights	open access
Related DOI	RIFIS Technical Report \|\| 16 \|\| p1-8
Related DOI	http://www.i.kyushu-u.ac.jp/research/report.html
Related URI	RIFIS Technical Report \|\| 16 \|\| p1-8
Related URI	http://www.i.kyushu-u.ac.jp/research/report.html
Relation	RIFIS Technical Report \|\| 16 \|\| p1-8
Relation	http://www.i.kyushu-u.ac.jp/research/report.html
Abstract	We prove that the lexicographically first maximal connected subgraph problem for a graph property $ /pi is Delta^{p}_{2} $-complete if $ pi $ is hereditary. determined by the blocks, and nontrivial ...on connected graphs.show more

File	FileType	Size	Views	Description
rifis-tr-16	pdf	932 KB	251

Record ID	3122
Peer-Reviewed	Unrefereed
Notes	Proc. Int. Workshop on Discrete Algorithms and Complexity, 1989, 187-194
Type	テクニカルレポート
Created Date	2009.04.22
Modified Date	2017.01.20