%0 Generic
%D 2012
%T Using Membrane Computing for Effective Homology
%A Hepzibah A. Christinal
%A Daniel Díaz-Pernil
%A Miguel A. Gutiérrez-Naranjo
%A Pedro Real
%C Berlin, Germany
%I Springer Verlag
%K Computational Algebraic Topology
%K Digital Topology
%K Effective Homology
%K Membrane computing
%K Tissue-like P systems
%N 5-6
%P 233-249
%R 10.1007/s00200-012-0176-6
%U http://link.springer.com/article/10.1007%2Fs00200-012-0176-6
%V 23
%X 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.
%8 12/2012