Finding Hamiltonian circuits in arrangements of Jordan curves is NP-complete

Authors:
Chuzo Iwamoto;Godfried T. Toussaint
Affiliations:
-;-
Venue:
Information Processing Letters
Year:
1994

Citing 0
Cited 3

Hamiltonicity and colorings of arrangement graphs

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Hamiltonicity and colorings of arrangement graphs

Discrete Applied Mathematics
An efficient critical protection scheme for intra-domain routing using link characteristics

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.90

Visualization

Abstract