The Hamiltonian Cycle and Travelling Salesman Problems in cP Systems

DOI10.3233/FI-2019-1760zbMath1414.68028OpenAlexW2909830840WikidataQ128533975 ScholiaQ128533975MaRDI QIDQ5379885

James Cooper, Radu Nicolescu

Publication date: 14 June 2019

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2019-1760

zbMATH Keywords

travelling salesman problemP systemsHamiltonian cycle problemcP systemsprolog terms and unification

Mathematics Subject Classification ID

Related Items (8)

A sublinear Sudoku solution in cP systems and its formal verification ⋮ Formal verification of cP systems using Coq ⋮ Sublinear P system solutions to NP-complete problems ⋮ Towards automated deduction in cP systems ⋮ Formal verification of cP systems using PAT3 and ProB ⋮ Solving a PSPACE-complete problem with cP systems ⋮ Travelling salesman problem in tissue P systems with costs ⋮ Alternative representations of P systems solutions to the graph colouring problem

This page was built for publication: The Hamiltonian Cycle and Travelling Salesman Problems in cP Systems