Graph traversal and graph transformation
Holdsworth, Jason (2004) Graph traversal and graph transformation. Theoretical Computer Science, 321 (2). pp. 215-231.
|PDF (Published Version) - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
Graph traversal algorithms are important since graphs are a common data structure in which information is distributed. None of the existing algorithmic paradigms focuses on graph traversal. This article introduces enNCE substitution as an extension to eNCE substitution. The relationship between enNCE substitution and eNCE substitution is explored. Moreover, an enNCE previous graph transformation system is defined and then used to generate depth-first and breadth-first previous graph traversal. Thus, enNCE previous graph transformation shows potential as a fundamental concept for a traversal-oriented algorithmic paradigm.
|Item Type:||Article (Refereed Research - C1)|
© 2004 Elsevier. : This journal is available online - use hypertext links above.
|Keywords:||Graph transformation system, Graph traversal, eNCE, enNCE|
|FoR Codes:||08 INFORMATION AND COMPUTING SCIENCES > 0802 Computation Theory and Mathematics > 080299 Computation Theory and Mathematics not elsewhere classified @ 100%|
|SEO Codes:||89 INFORMATION AND COMMUNICATION SERVICES > 8999 Other Information and Communication Services > 899999 Information and Communication Services not elsewhere classified @ 100%|
|Deposited On:||13 Oct 2006|
|Last Modified:||10 May 2013 00:20|
Last 12 Months: 0
|Citation Counts with External Providers:||Web of Science: 0|
Repository Staff Only: item control page