"The NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs ..."

Ján Plesník (1979)

Details and statistics

DOI: 10.1016/0020-0190(79)90023-1

access: closed

type: Journal Article

metadata version: 2018-11-14

a service of  Schloss Dagstuhl - Leibniz Center for Informatics