A note on the Hamiltonian circuit problem on directed path graphs

Authors:
Giri Narasimhan
Affiliations:
Univ. of Wisconsin-Madison, Madison
Venue:
Information Processing Letters
Year:
1989

Citing 0
Cited 2

Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs

Theoretical Computer Science
The longest path problem is polynomial on cocomparability graphs

WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science

Quantified Score

Hi-index	0.89

Visualization

Abstract