A uniform solution to the independent set problem through tissue P systems with cell separation

2012 ◽  
Author(s):  
Xingyi Zhang ◽  
Xiangxiang Zeng ◽  
Bin Luo ◽  
Zheng Zhang
Keyword(s):  
Cell Separation ◽  
Independent Set ◽  
P Systems ◽  
Independent Set Problem ◽  
Uniform Solution

A Uniform Solution to Subset Sum by Tissue P Systems with Cell Separation

2010 ◽  
Vol 7 (8) ◽  
pp. 1507-1513
Author(s):  
Yun Jiang ◽  
Xingyi Zhang ◽  
Zheng Zhang
Keyword(s):  
Cell Separation ◽  
P Systems ◽  
Subset Sum ◽  
Uniform Solution

scholarly journals Time-free Solution to Independent Set Problem using P Systems with Active Membranes

2021 ◽  
Vol 182 (3) ◽  
pp. 243-255
Author(s):  
Yu Jin ◽  
Bosheng Song ◽  
Yanyan Li ◽  
Ying Zhu
Keyword(s):  
Membrane Computing ◽  
Independent Set ◽  
P Systems ◽  
Natural Computing ◽  
Free Solution ◽  
Independent Set Problem ◽  
Global Clock ◽  
Active Membranes ◽  
Biological Reality ◽  
Hard Problems

Membrane computing is a branch of natural computing aiming to abstract computing models from the structure and functioning of living cells. The computation models obtained in the field of membrane computing are usually called P systems. P systems have been used to solve computationally hard problems efficiently on the assumption that the execution of each rule is completed in exactly one time-unit (a global clock is assumed for timing and synchronizing the execution of rules). However, in biological reality, different biological processes take different times to be completed, which can also be influenced by many environmental factors. In this work, with this biological reality, we give a time-free solution to independent set problem using P systems with active membranes, which solve the problem independent of the execution time of the involved rules.

A constrained independent set problem for matroids

2004 ◽  
Vol 32 (1) ◽  
pp. 23-26 ◽  
Author(s):  
Tamás Fleiner ◽  
András Frank ◽  
Satoru Iwata
Keyword(s):  
Independent Set ◽  
Independent Set Problem

A New Parallel Algorithm for the Maximal Independent Set Problem

1989 ◽  
Vol 18 (2) ◽  
pp. 419-427 ◽  
Author(s):  
Mark Goldberg ◽  
Thomas Spencer
Keyword(s):  
Parallel Algorithm ◽  
Independent Set ◽  
Maximal Independent Set ◽  
Independent Set Problem

scholarly journals New Instances for Maximum Weight Independent Set From a Vehicle Routing Application

2021 ◽  
Vol 2 (4) ◽  
Author(s):  
Yuanyuan Dong ◽  
Andrew V. Goldberg ◽  
Alexander Noe ◽  
Nikos Parotsidis ◽  
Mauricio G. C. Resende ◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Real World ◽  
Vehicle Routing Problem ◽  
Independent Set ◽  
Maximum Weight ◽  
Routing Problem ◽  
Independent Set Problem ◽  
Maximum Weight Independent Set ◽  
Large Size

AbstractWe present a set of new instances of the maximum weight independent set problem. These instances are derived from a real-world vehicle routing problem and are challenging to solve in part because of their large size. We present instances with up to 881 thousand nodes and 383 million edges.

Sign in / Sign up

Export Citation Format

Share Document