Journal Article

The edge Hamiltonian path problem is NP-complete

Information Processing Letters (1981) 13(4-5) 157-159
DOI: 10.1016/0020-0190(81)90048-X
87Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Author supplied keywords

Cite

CITATION STYLE

APA

Bertossi, A. A. (1981). The edge Hamiltonian path problem is NP-complete. Information Processing Letters, 13(4–5), 157–159. https://doi.org/10.1016/0020-0190(81)90048-X

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free