An efficient algorithm for the detection of Eden
|
Accepted Version
(PDF 712kB)
complex-systems_DJW_RFH_NAK_DM_11102013.pdf. |
Description
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 pre-image 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.
Full-text downloads:
Full-text 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: | 220430 | ||||||
---|---|---|---|---|---|---|---|
Item Type: | Contribution to Journal (Journal Article) | ||||||
Refereed: | Yes | ||||||
ORCID iD: |
|
||||||
Measurements or Duration: | 28 pages | ||||||
ISSN: | 0891-2513 | ||||||
Pure ID: | 32568620 | ||||||
Divisions: | Past > Institutes > Institute of Health and Biomedical Innovation Past > QUT Faculties & Divisions > Science & Engineering Faculty Past > QUT Faculties & Divisions > Division of Technology, Information and Library Services Current > Research Centres > High Performance Computing and Research Support |
||||||
Copyright Owner: | Copyright 2013 Complex Systems Publications, Inc. | ||||||
Copyright Statement: | This work is covered by copyright. Unless the document is being made available under a Creative Commons Licence, you must assume that re-use is limited to personal use and that permission from the copyright owner must be obtained for all other uses. If the document is available under a Creative Commons License (or other specified license) then refer to the Licence for details of permitted re-use. It is a condition of access that users recognise and abide by the legal requirements associated with these rights. If you believe that this work infringes copyright please provide details by email to qut.copyright@qut.edu.au | ||||||
Deposited On: | 06 Nov 2021 11:58 | ||||||
Last Modified: | 02 Mar 2024 09:13 |
Export: EndNote | Dublin Core | BibTeX
Repository Staff Only: item control page