{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T16:10:54Z","timestamp":1744906254618},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,3,24]],"date-time":"2016-03-24T00:00:00Z","timestamp":1458777600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s11786-016-0261-5","type":"journal-article","created":{"date-parts":[[2016,3,24]],"date-time":"2016-03-24T05:03:13Z","timestamp":1458795793000},"page":"249-261","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Membrane Computing to Enhance Time Efficiency of Minimum Dominating Set"],"prefix":"10.1007","volume":"10","author":[{"given":"Ali Abdulkareem","family":"Mahmood","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Maroosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravie Chandren","family":"Muniyandi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,24]]},"reference":[{"key":"261_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56196-2","volume-title":"Membrane Computing: An Introduction","author":"G P\u0103un","year":"2002","unstructured":"P\u0103un, G.: Membrane Computing: An Introduction. Springer, Berlin (2002)"},{"key":"261_CR2","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1016\/j.jocs.2014.07.003","volume":"5","author":"A Maroosi","year":"2014","unstructured":"Maroosi, A., Muniyandi, R.C.: Enhancement of membrane computing model implementation on GPU by introducing matrix representation for balancing occupancy and reducing inter-block communications. J. Comput. Sci. 5, 861\u2013871 (2014)","journal-title":"J. Comput. Sci."},{"key":"261_CR3","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.simpat.2014.05.005","volume":"47","author":"A Maroosi","year":"2014","unstructured":"Maroosi, A., Muniyandi, R.C., Sundararajan, E.A., Zin, A.M.: Parallel and distributed computing models on a graphics processing unit to accelerate simulation of membrane systems. Simul. Model. Pract. Theory 47, 60\u201378 (2014)","journal-title":"Simul. Model. Pract. Theory"},{"key":"261_CR4","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/j.protcy.2013.12.179","volume":"11","author":"A Maroosi","year":"2013","unstructured":"Maroosi, A., Muniyandi, R.C., Sundararajan, E.A., Zin, A.M.: Improved implementation of simulation for membrane computing on the graphic processing unit. Proc. Technol. 11, 184\u2013190 (2013)","journal-title":"Proc. Technol."},{"key":"261_CR5","doi-asserted-by":"crossref","unstructured":"P\u0103un, G.: Computing with Membranes: Attacking NP-Complete Problems. Unconventional Models of Computation, UMC 2K. Springer, New York, pp. 94\u2013115 (2001)","DOI":"10.1007\/978-1-4471-0313-4_7"},{"key":"261_CR6","first-page":"63","volume":"15","author":"R Muniyandi","year":"2012","unstructured":"Muniyandi, R., Abdullah, M.Z.: Modeling hormone-induced calcium oscillations in liver cell with membrane computing. Rom. J. Inform. Sci. Technol. 15, 63\u201376 (2012)","journal-title":"Rom. J. Inform. Sci. Technol."},{"key":"261_CR7","doi-asserted-by":"crossref","first-page":"122","DOI":"10.3844\/jcssp.2013.122.127","volume":"9","author":"R Muniyandi","year":"2013","unstructured":"Muniyandi, R.: Membrane computing as the paradigm for modeling systems biology. J. Comput. Sci. 9, 122 (2013)","journal-title":"J. Comput. Sci."},{"key":"261_CR8","doi-asserted-by":"crossref","first-page":"264","DOI":"10.3844\/jcssp.2013.264.270","volume":"9","author":"A Maroosi","year":"2013","unstructured":"Maroosi, A., Muniyandi, R.C.: Membrane computing inspired genetic algorithm on multi-core processors. J. Comput. Sci. 9, 264\u2013270 (2013)","journal-title":"J. Comput. Sci."},{"key":"261_CR9","doi-asserted-by":"crossref","unstructured":"Ali, M., Muniyandi, R.C.: A hybrid membrane computing and honey bee mating algorithm as an intelligent algorithm for channel assignment problem. In: Proceedings of the 8th International Conference on Bio-Inspired Computing: Theories and Applications, pp. 1021\u20131028. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-37502-6_119"},{"key":"261_CR10","first-page":"423","volume":"11","author":"MJP Jim\u00e9nez","year":"2006","unstructured":"Jim\u00e9nez, M.J.P., Jim\u00e9nez, A.R., Caparrini, F.S.: A polynomial complexity class in P systems using membrane division. J. Autom. Lang. Comb. 11, 423\u2013434 (2006)","journal-title":"J. Autom. Lang. Comb."},{"key":"261_CR11","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF03037637","volume":"23","author":"MJP Jim\u00e9nez","year":"2005","unstructured":"Jim\u00e9nez, M.J.P., N\u00fa\u00f1ez, A.R.: Solving the subset-sum problem by P systems with active membranes. New Gener. Comput. 23, 339\u2013356 (2005)","journal-title":"New Gener. Comput."},{"key":"261_CR12","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.tcs.2008.04.005","volume":"404","author":"D D\u00edaz-Pernil","year":"2008","unstructured":"D\u00edaz-Pernil, D., Guti\u00e9rrez-Naranjo, M.A., Perez-Jim\u00e9nez, M.J., Riscos-N\u00fa\u00f1ez, A.: A uniform family of tissue P systems with cell division solving 3-COL in a linear time. Theor. Comput. Sci. 404, 76\u201387 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"261_CR13","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.tcs.2014.05.004","volume":"551","author":"A Maroosi","year":"2014","unstructured":"Maroosi, A., Muniyandi, R.C.: Accelerated execution of P systems with active membranes to solve the N-queens problem. Theor. Comput. Sci. 551, 39\u201354 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"261_CR14","doi-asserted-by":"crossref","unstructured":"Maroosi, A., Muniyandi, R.C.: Accelerated simulation of membrane computing to solve the n-queens problem on multi-core. In: Swarm, Evolutionary, and Memetic Computing. Lecture Notes in Computer Science, vol. 8298, pp. 257\u2013267 (2013)","DOI":"10.1007\/978-3-319-03756-1_23"},{"key":"261_CR15","volume-title":"Computers and Interactability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Interactability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"261_CR16","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/s11036-008-0131-8","volume":"14","author":"H Samuel","year":"2009","unstructured":"Samuel, H., Zhuang, W., Preiss, B.: DTN based dominating set routing for MANET in heterogeneous wireless networking. Mobile Netw. Appl. 14, 154\u2013164 (2009)","journal-title":"Mobile Netw. Appl."},{"key":"261_CR17","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: What cannot be computed locally. In: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, pp. 300\u2013309. ACM, New York (2004)","DOI":"10.1145\/1011767.1011811"},{"key":"261_CR18","doi-asserted-by":"crossref","unstructured":"Lenzen, C., Oswald, Y.A., Wattenhofer, R.: What can be approximated locally? Case study: dominating sets in planar graphs. In: Proceedings of the 20th Annual Symposium on Parallelism in Algorithms and Architectures. ACM, New York (2008)","DOI":"10.1145\/1378533.1378540"},{"key":"261_CR19","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"RG Michael","year":"1979","unstructured":"Michael, R.G., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman, San Francisco (1979)"},{"key":"261_CR20","doi-asserted-by":"crossref","unstructured":"Cheng, Z., Xiao, J., Huang, Y.: Algorithmic tile self-assembly model for the minimum dominating set problem. In: Bansal, J.C., Singh, P.K., Deep, K., Pant, M., Nagar, A.K.: Proceedings of 7th International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA 2012), vol. 201, pp. 379\u2013390. Springer, India (2013)","DOI":"10.1007\/978-81-322-1038-2_32"},{"key":"261_CR21","series-title":"Exact (exponential) algorithms for the dominating set problem","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"FV Fomin","year":"2005","unstructured":"Fomin, F.V., Kratsch, D., Woeginger, G.J.: Graph-Theoretic Concepts in Computer Science. Exact (exponential) algorithms for the dominating set problem. Springer, New York (2005)"},{"key":"261_CR22","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s00446-004-0112-5","volume":"17","author":"F Kuhn","year":"2005","unstructured":"Kuhn, F., Wattenhofer, R.: Constant-time distributed dominating set approximation. Distrib. Comput. 17, 303\u2013310 (2005)","journal-title":"Distrib. Comput."},{"key":"261_CR23","unstructured":"Randerath, B., Schiermeyer, I.: Exact algorithms for minimum dominating set. In: Technical Report, Zentrum fur Angewandte Informatik Koln, Lehrstuhl Speckenmeyer (2004)"},{"key":"261_CR24","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.jda.2005.03.002","volume":"4","author":"F Grandoni","year":"2006","unstructured":"Grandoni, F.: A note on the complexity of minimum dominating set. J. Discrete Algorithms 4, 209\u2013214 (2006)","journal-title":"J. Discrete Algorithms"},{"key":"261_CR25","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1145\/322326.322328","volume":"29","author":"K Takamizawa","year":"1982","unstructured":"Takamizawa, K., Nishizeki, T., Saito, N.: Linear-time computability of combinatorial problems on series-parallel graphs. J. ACM (JACM) 29, 623\u2013641 (1982)","journal-title":"J. ACM (JACM)"},{"key":"261_CR26","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0167-5060(08)71047-1","volume":"48","author":"BN Clark","year":"1991","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Ann. Discrete Math. 48, 165\u2013177 (1991)","journal-title":"Ann. Discrete Math."},{"key":"261_CR27","series-title":"Hybrid genetic algorithm for minimum dominating set problem","volume-title":"Computational Science and Its Applications ICCSA","author":"AR Hedar","year":"2010","unstructured":"Hedar, A.R., Ismail, R.: Computational Science and Its Applications ICCSA. Hybrid genetic algorithm for minimum dominating set problem. Springer, Berlin Heidelberg (2010)"},{"key":"261_CR28","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.tcs.2004.03.053","volume":"324","author":"G P\u0103un","year":"2004","unstructured":"P\u0103un, G., Suzuki, Y., Tanaka, H., Yokomori, T.: On the power of membrane division in P systems. Theor. Comput. Sci. 324, 61\u201385 (2004)","journal-title":"Theor. Comput. Sci."}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-016-0261-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-016-0261-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-016-0261-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T23:04:43Z","timestamp":1567724683000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-016-0261-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,24]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["261"],"URL":"https:\/\/doi.org\/10.1007\/s11786-016-0261-5","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,24]]}}}