@article {923,
title = {Using Membrane Computing for Effective Homology},
journal = {Applicable Algebra in Engineering, Communication and Computing},
volume = {23},
year = {2012},
month = {12/2012},
pages = {233-249},
publisher = {Springer Verlag},
address = {Berlin, Germany},
abstract = {Effective Homology is an algebraic-topological method based on the computational concept of chain homotopy equivalence on a cell complex. Using this algebraic data structure, Effective Homology gives answers to some important computability problems in Algebraic Topology. In a discrete context, Effective Homology can be seen as a combinatorial layer given by a forest graph structure spanning every cell of the complex. In this paper, by taking as input a pixel-based 2D binary object, we present a logarithmic-time uniform solution for describing a chain homotopy operator ϕ for its adjacency graph. This solution is based on Membrane Computing techniques applied to the spanning forest problem and it can be easily extended to higher dimensions.},
keywords = {Computational Algebraic Topology, Digital Topology, Effective Homology, Membrane computing, Tissue-like P systems},
issn = {0938-1279},
doi = {10.1007/s00200-012-0176-6 },
url = {http://link.springer.com/article/10.1007\%2Fs00200-012-0176-6},
author = {Hepzibah A. Christinal and Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo and Pedro Real}
}