Finding Hamiltonian circuits in arrangements of Jordan curves is NP- complete
type: Item
instance of: scholarly article
title: Finding Hamiltonian circuits in arrangements of Jordan curves is NP- complete
zbMATH Open document ID: 0823.68084
DOI: 10.1016/0020-0190(94)90125-2
author: C. Iwamoto
author: Godfried Toussaint
published in: Information Processing Letters
publication date: 1995-01-09T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 708675
zbMATH Keywords: Hamiltonian circuit
zbMATH Keywords: Jordan-curve
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)90125-2
OpenAlex ID: W2034646155
cites work: Q3888545
cites work: A linear algorithm for embedding planar graphs using PQ-trees
cites work: Q3689218
cites work: On Envelopes of Arrangements of Lines
cites work: The Planar Hamiltonian Circuit Problem is NP-Complete
cites work: The Hamiltonian Circuit Problem is Polynomial for 4-Connected Planar Graphs
cites work: Q4142699
cites work: The edge Hamiltonian path problem is NP-complete for bipartite graphs
cites work: Computing simple circuits from a set of line segments
cites work: A Theorem on Planar Graphs
description: scientific article; zbMATH DE number 708675