"The Edge Hamiltonian Path Problem is NP-Complete."

Alan A. Bertossi (1981)

Details and statistics

DOI: 10.1016/0020-0190(81)90048-X

access: closed

type: Journal Article

metadata version: 2017-05-26

a service of  Schloss Dagstuhl - Leibniz Center for Informatics