An efficient algorithm for the detection of Eden
Warne, David J., Hayward, Ross F., Kelson, Neil A., & Mallet, Dann G. (2013) An efficient algorithm for the detection of Eden. Complex Systems, 22(4), pp. 377404.

Accepted Version
(PDF 712kB)

View at publisher (open access)
Abstract
In this paper, a polynomial time algorithm is presented for solving the Eden problem for graph cellular automata. The algorithm is based on our neighborhood elimination operation which removes local neighborhood configurations which cannot be used in a preimage of a given configuration. This paper presents a detailed derivation of our algorithm from first principles, and a detailed complexity and accuracy analysis is also given. In the case of time complexity, it is shown that the average case time complexity of the algorithm is \Theta(n^2), and the best and worst cases are \Omega(n) and O(n^3) respectively. This represents a vast improvement in the upper bound over current methods, without compromising average case performance.
Impact and interest:
Citation counts are sourced monthly from Scopus and Web of Science® citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.
Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.
Fulltext downloads:
Fulltext downloads displays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.
ID Code:  63368 

Item Type:  Journal Article 
Refereed:  Yes 
Additional URLs:  
Keywords:  Cellular Automata, Eden Problem, Predecessor Existence Problem, Polynomial Algorithm 
ISSN:  08912513 
Subjects:  Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > COMPUTATION THEORY AND MATHEMATICS (080200) > Analysis of Algorithms and Complexity (080201) Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > COMPUTATION THEORY AND MATHEMATICS (080200) > Computation Theory and Mathematics not elsewhere classified (080299) 
Divisions:  Current > QUT Faculties and Divisions > Division of Technology, Information and Learning Support Current > Schools > School of Electrical Engineering & Computer Science Current > Research Centres > High Performance Computing and Research Support Current > Schools > School of Mathematical Sciences Current > QUT Faculties and Divisions > Science & Engineering Faculty 
Copyright Owner:  Copyright 2013 Complex Systems Publications, Inc. 
Deposited On:  07 Jan 2014 02:29 
Last Modified:  03 Sep 2014 05:47 
Export: EndNote  Dublin Core  BibTeX
Repository Staff Only: item control page