Used together with:
graph
(1)
decomposit
(1)
npc
(1)
complet
(1)
proof
(1)
Stem
holyer$ (
all stems
)
1 papers:
STOC-1992-DorT
#composition
#graph
#proving
Graph Decomposition Is NPC-A Complete Proof of Holyer’s Conjecture (
DD
,
MT
), pp. 252–263.
Bibliography of Software Language Engineering in Generated Hypertext
(
BibSLEIGH
) is created and maintained by
Dr. Vadim Zaytsev
.
Hosted as a part of
SLEBOK
on
GitHub
.