Membrane Computing to Enhance Time Efficiency of Minimum Dominating Set

[1]  Ravie Chandren Muniyandi,et al.  Enhancement of membrane computing model implementation on GPU by introducing matrix representation for balancing occupancy and reducing inter-block communications , 2014, J. Comput. Sci..

[2]  Ravie Chandren Muniyandi,et al.  Accelerated execution of P systems with active membranes to solve the N-queens problem , 2014, Theor. Comput. Sci..

[3]  Elankovan Sundararajan,et al.  Parallel and distributed computing models on a graphics processing unit to accelerate simulation of membrane systems , 2014, Simul. Model. Pract. Theory.

[4]  Ravie Chandren Muniyandi,et al.  Accelerated Simulation of Membrane Computing to Solve the N-queens Problem on Multi-core , 2013, SEMCCO.

[5]  Ravie Chandren Muniyandi,et al.  Membrane Computing Inspired Genetic Algorithm on Multi-Core Processors , 2013, J. Comput. Sci..

[6]  Abdullah Mohd Zin,et al.  Membrane Computing as the Paradigm for Modeling Systems Biology , 2013, J. Comput. Sci..

[7]  Weihua Zhuang,et al.  DTN Based Dominating Set Routing for MANET in Heterogeneous Wireless Networking , 2009, Mob. Networks Appl..

[8]  Mario J. Pérez-Jiménez,et al.  A uniform family of tissue P systems with cell division solving 3-COL in a linear time , 2008, Theor. Comput. Sci..

[9]  Christoph Lenzen,et al.  What can be approximated locally?: case study: dominating sets in planar graphs , 2008, SPAA '08.

[10]  Fabrizio Grandoni,et al.  A note on the complexity of minimum dominating set , 2006, J. Discrete Algorithms.

[11]  Gheorghe Paun,et al.  On the power of membrane division in P systems , 2004, Theor. Comput. Sci..

[12]  Roger Wattenhofer,et al.  What cannot be computed locally! , 2004, PODC '04.

[13]  Roger Wattenhofer,et al.  Constant-Time Distributed Dominating Set Approximation , 2003 .

[14]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[15]  Gheorghe Paun,et al.  Computing with Membranes: Attacking NP-Complete Problems , 2000, UMC.

[16]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[17]  Nobuji Saito,et al.  Linear-time computability of combinatorial problems on series-parallel graphs , 1982, JACM.

[18]  Pinar Heggernes,et al.  Graph-Theoretic Concepts in Computer Science , 2016, Lecture Notes in Computer Science.

[19]  Ravie Chandren Muniyandi,et al.  A Hybrid Membrane Computing and Honey Bee Mating Algorithm as an Intelligent Algorithm for Channel Assignment Problem , 2013, BIC-TA.

[20]  Abdullah Mohd Zin,et al.  Improved Implementation of Simulation for Membrane Computing on the Graphic Processing Unit , 2013 .

[21]  Zhen Cheng,et al.  Algorithmic Tile Self-assembly Model for the Minimum Dominating Set Problem , 2012, BIC-TA.

[22]  Abdullah Mohd Zin,et al.  Modeling hormone-induced calcium oscillations in liver cell with membrane computing , 2012 .

[23]  Mario J. Pérez-Jiménez,et al.  Solving the Subset-Sum problem by P systems with active membranes , 2009, New Generation Computing.

[24]  Mario J. Pérez-Jiménez,et al.  A Polynomial Complexity Class in P Systems Using Membrane Division , 2003, DCFS.

[25]  Ulrik Brandes,et al.  Graph-Theoretic Concepts in Computer Science , 2002, Lecture Notes in Computer Science.

[26]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .