"NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs"

B. S. Panda, Dinabandhu Pradhan (2008)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2021-06-09