Graph traversal and graph transformation

Authors:
Jason J. Holdsworth
Affiliations:
School of Information Technology, James Cook University, P.O. Box 68ll, Cairns, QLD 4870, Australia
Venue:
Theoretical Computer Science
Year:
2004

Citing 7
Cited 0

Introduction to algorithms

Introduction to algorithms
LEDA: a platform for combinatorial and geometric computing

Communications of the ACM
An introduction to distributed algorithms

An introduction to distributed algorithms
Functional programming with graphs

ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Handbook of graph grammars and computing by graph transformation: volume I. foundations

Handbook of graph grammars and computing by graph transformation: volume I. foundations
Node replacement graph grammars

Handbook of graph grammars and computing by graph transformation
Graph relabelling systems and distributed algorithms

Handbook of graph grammars and computing by graph transformation

Quantified Score

Hi-index	5.23

Visualization

Abstract

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 graph transformation system is defined and then used to generate depth-first and breadth-first graph traversal. Thus, enNCE graph transformation shows potential as a fundamental concept for a traversal-oriented algorithmic paradigm.