Vertex cover problem3-satisfiability problemSummary: In this paper, the communication complexity of non-confluent solutions for Vertex Cover Problem (VCP) and 3-Satisfiability Problem (3SP) in evolution-communication P systems (ECP) are analyzed. We use dynamical communication measures suggested by ...
In this paper, the communication complexity of non-confluent solutions for Vertex Cover Problem (VCP) and 3-Satisfiability Problem (3SP) in Evolution-Communication P systems (ECP) are analyzed. We use dynamical communication measures suggested by previous literature in our analysis. Solutions are ...