THE GENERAL COMPLEXITY OF THE PROBLEM TO RECOGNIZE HAMILTONIAN PATHS

DOI10.17223/20710410/53/8OpenAlexW4206818985MaRDI QIDQ5155650

Alexander N. Rybalov

Publication date: 8 October 2021

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm750

zbMATH Keywords

Hamiltonian pathgeneric complexity

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Related Items (2)

The generic complexity of the bounded problem of graphs clustering ⋮ The generic complexity of the graph triangulation problem

This page was built for publication: THE GENERAL COMPLEXITY OF THE PROBLEM TO RECOGNIZE HAMILTONIAN PATHS