A P system for Hamiltonian cycle problem

Guo, Ping; Dai, Yunlei; Chen, Haizhu

doi:10.1016/j.ijleo.2016.06.016

Cited by 10 publications

(8 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [15], a parallel algorithm PAHCP (Parallel algorithm for Hamiltonian cycle problem) is given to solve the all solution of the Hamiltonian problem. Based on the idea of PAHCP, a parallel algorithm PATSP (Parallel algorithm for TSP) for all solutions of TSP can be described as Table 1.…”

Section: Endmentioning

confidence: 99%

“…Researchers have designed several P systems to solve NPhard problems, such as SAT [7], [8], HPP [9], [10], TSP [11]- [15] and so on. The TSP (namely, travelling salesman problem) is a typical representative of the NP hard problem.…”

Section: Introductionmentioning

confidence: 99%

“…As a continuation of the research in [15], we have designed a P system to solve the TSP problem in this paper. The P system includes path construction, path detection, path comparison and path clipping, and its computational complexity is O(n 2 ).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A P System for Solving All-Solutions of TSP

Guo¹,

Xiang²,

Xie³

et al. 2017

ijacsa

Self Cite

View full text Add to dashboard Cite

Abstract-P system is a parallel computing system based on a membrane computing model. Since the calculation process of the P system has the characteristics of maximum parallelism and Non-determinism, it has been used to solve the NP-hard problem in polynomial time. This paper designs a P system for TSP problem solving. This P system can not only determine whether the TSP problem has solution, but also give the allsolution when the TSP problem is solved. Finally, an example is given to illustrate the feasibility and effectiveness of the P system designed in this paper.

show abstract

Section: Endmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A P System for Solving All-Solutions of TSP

Guo¹,

Xiang²,

Xie³

et al. 2017

ijacsa

Self Cite

View full text Add to dashboard Cite

show abstract

“…The models of P system are mainly divided into three types, namely, the cell-like P system [2], the tissue-like P system [3] and the neural-like P system [4]. They have been applied to solve the problems such as NP problems [5]- [8], image processing [9], [10], arithmetic operations [11]- [14] and so on.…”

Section: Introductionmentioning

confidence: 99%

The P System Design Method based on the P Module

Guo¹,

Peng²,

Lian³

2018

ijacsa

Self Cite

View full text Add to dashboard Cite

Abstract-Membrane computing is a kind of biocomputing model. At present, the main research areas of membrane computing are computational models and P system design. With the expansion of the P system scale, how to rapidly construct the P system has become a prominent issue. Designing P system based on P module is a P system design method proposed in recent years. This method provides information hiding and can build P system through recursive combination. However, the current P module design lacks a unified design method and lacks the standard process of building P system from P module. This paper studies the structural characteristics of cell-like P systems, and proposes an improved P module design method and a process for assembling P systems through P modules. In order to fully expound the design method of P module, the P system for the square root of the large number was analyzed and designed. And the correctness of the P system based on the P module design method was verified by an instance.

show abstract

“…Therefore, NP-hard problems can be solved efficiently. Until now, many kinds of P systems can solve some NP-complete problems, such as SAT [4][5][6][7][8][9][10], 3coloring problem [11], and Hamiltonian cycle problem [12]. In addition, many new variants of P systems have equivalent computing power with Turing machine and to be Turing universal as language generators [13][14][15].…”

Section: Introductionmentioning

confidence: 99%

Time‐Free Solution to SAT Problem by Tissue P Systems

Luo

Xiong

Zhang

2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Tissue P systems are a class of computing models inspired by intercellular communication, where the rules are used in the nondeterministic maximally parallel manner. As we know, the execution time of each rule is the same in the system. However, the execution time of biochemical reactions is hard to control from a biochemical point of view. In this work, we construct a uniform and efficient solution to the SAT problem with tissue P systems in a time-free way for the first time. With the P systems constructed from the sizes of instances, the execution time of the rules has no influence on the computation results. As a result, we prove that such system is shown to be highly effective for NP-complete problem even in a time-free manner with communication rules of length at most 3.

show abstract

A P system for Hamiltonian cycle problem

Cited by 10 publications

References 18 publications

A P System for Solving All-Solutions of TSP

A P System for Solving All-Solutions of TSP

The P System Design Method based on the P Module

Time‐Free Solution to SAT Problem by Tissue P Systems

Contact Info

Product

Resources

About