Cellular Automata Supporting -Connectivity

Biljana Stamatovic, Gregor Kosec, Roman Trobec, Xiao Xuan and Sinisa Stamatovic

Mathematical Problems in Engineering, 2014, vol. 2014, 1-6

Abstract:

We propose a new algorithm based on cellular automation (CA) for preserving -connectivity, . The CA algorithm transforms an initial grid configuration in a grid with same number of holes but without 1-connected components. Also, maximal thinning of -connected components, , is achieved. The grid can be used as initial for investigating properties of initial grid. Computational performances are evaluated and measured on real cases. The obtained results indicate that the proposed approach achieves comparable complexity as standard approaches; however, the speed-up and scalability of the proposed algorithm are not limited by the number of processing nodes.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2014/765798.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2014/765798.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:765798

DOI: 10.1155/2014/765798

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().