Time-free solution to Hamilton path problems using P systems with \(d\)-division

DOI10.1155/2013/975798zbMath1397.68078DBLPjournals/jam/SongWZ13OpenAlexW1994867434WikidataQ59007289 ScholiaQ59007289MaRDI QIDQ1791419

Tao Song, Hongjiang Zheng, Xun Wang

Publication date: 10 October 2018

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/975798

zbMATH Keywords

Hamiltonian path problem

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Computational efficiency and universality of timed P systems with membrane creation

This page was built for publication: Time-free solution to Hamilton path problems using P systems with \(d\)-division