scientific article
From MaRDI portal
Publication:3959443
zbMath0495.68059MaRDI QIDQ3959443
Daniel Turzík, Pavel Pudlák, Svatopluk Poljak
Publication date: 1982
Full work available at URL: https://eudml.org/doc/17184
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmsHamiltonian cyclespolynomial timefinite setrelations between decision and construction problems
Permutations, words, matrices (05A05) Paths and cycles (05C38) Complexity of computation (including implicit computational complexity) (03D15) Discrete mathematics in relation to computer science (68R99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (5)
On the complexity of the parity argument and other inefficient proofs of existence ⋮ On common edges in optimal solutions to traveling salesman and other optimization problems ⋮ A data structure useful for finding Hamiltonian cycles ⋮ On existence theorems ⋮ The complexity of finding a second Hamiltonian cycle in cubic graphs
This page was built for publication:
