A note on "A note on 'Some simplified NP-complete graph problems'"

Authors:
M. R. Garey;D. S. Johnson
Affiliations:
Bell Laboratories, Murray Hill, New Jersey;Bell Laboratories, Murray Hill, New Jersey
Venue:
ACM SIGACT News
Year:
1978

Citing 2
Cited 2

Some NP-complete geometric problems

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
A note on "Some simplified NP-complete graph problems"

ACM SIGACT News

Parameterized algorithmics for linear arrangement problems

Discrete Applied Mathematics
A metric for rooted trees with unlabeled vertices based on nested parentheses

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract