<technical report>
A New Series of $Delta^{p}_{2}$ -Complete Problemse
Creator | |
---|---|
Language | |
Publisher | |
Date | |
Source Title | |
Vol | |
Publication Type | |
Access Rights | |
Related DOI | |
Related URI | |
Relation | |
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 |
Hide fulltext details.
File | FileType | Size | Views | Description |
---|---|---|---|---|
rifis-tr-16 | 932 KB | 265 |
Details
Record ID | |
---|---|
Peer-Reviewed | |
Notes | |
Type | |
Created Date | 2009.04.22 |
Modified Date | 2017.01.20 |