Plump, Detlef orcid.org/0000-0002-1148-822X and Bak, Christopher (2012) Rooted Graph Programs. In: Krause, Christian and Westfechtel, Bernhard, (eds.) Proceedings 7th International Workshop on Graph Based Tools (GraBaTs 2012). 7th International Workshop on Graph Based Tools (GraBaTs 2012), 24 Sep 2012 Electronic Communications of the EASST . , DEU
Abstract
We present an approach for programming with graph transformation rules in which programs can be as efficient as programs in imperative languages. The basic idea is to equip rules and host graphs with distinguished nodes, so-called roots, and to match roots in rules with roots in host graphs. This enables graph transformation rules to be matched in constant time, provided that host graphs have a bounded node degree (which in practice is often the case). Hence, for example, programs with a linear bound on the number of rule applications run in truly linear time. We demonstrate the feasibility of this approach with a case study in graph colouring.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Editors: |
|
Keywords: | Graph programs,rooted graphs,time complexity,constant-time graph matching ,graph colouring |
Dates: |
|
Institution: | The University of York |
Academic Units: | The University of York > Faculty of Sciences (York) > Computer Science (York) |
Depositing User: | Pure (York) |
Date Deposited: | 10 Jan 2023 14:50 |
Last Modified: | 16 Feb 2025 00:04 |
Published Version: | https://doi.org/10.14279/tuj.eceasst.54.780.778 |
Status: | Published |
Series Name: | Electronic Communications of the EASST |
Identification Number: | 10.14279/tuj.eceasst.54.780.778 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:195067 |