|
| Title |
A
graph problem deriving various complete variants for
several complexity classes |
| Authors |
Taishi
Nishida, Etsuro Moriya |
| Keywords |
connected
subgraph, complexity class, complete problem, NL-complete,
P-complete, NP-complete, PSPACE-complete, EXP-complete,
NEXP-complete |
| Documents |
◇ Manuscript（PDF）
◇ Abstract（PDF） |
|
|
|
