A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs (Q788489)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3843136
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs |
scientific article; zbMATH DE number 3843136 |
Statements
A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs (English)
0 references
1984
0 references
The Hamiltonian cycle problem is a well-known NP-complete problem. Some restrictions of this problem, even for planar graphs, remain NP-complete while other subclasses possess polynomial-time algorithms. The authors consider the class of 4-connected maximal planar graphs. Using a slight modification of Whitney's theorem [\textit{H. Whitney}, Ann. Math., II. Ser. 32, 378-390 (1931; Zbl 0002.16101)] the authors present a linear time algorithm for finding a Hamiltonian cycle in 4-connected maximal planar graphs.
0 references
Hamiltonian cycle
0 references
planar graph
0 references
NP-complete
0 references
linear time algorithm
0 references
0.9231024384498596
0 references
0.8313406705856323
0 references
0.8204437494277954
0 references
0.8096211552619934
0 references
