Time and space complexity of rule-based graph programs

Courtehoute, Brian ORCID: 0000-0002-7736-4852 (2023) Time and space complexity of rule-based graph programs. PhD thesis, University of York.



Supervisors: Plump, Detlef
Keywords: GP 2, Graph Programming, Rooted Graph Transformation, Complexity, Semantics
Awarding institution: University of York
Academic Units: The University of York > Computer Science (York)
Identification Number/EthosID: uk.bl.ethos.890388
Depositing User: Brian Courtehoute
Date Deposited: 07 Sep 2023 15:01
Last Modified: 21 Sep 2023 09:53



You do not need to contact us to get a copy of this thesis. Please use the 'Download' link(s) above to get a copy.
You can contact us about this thesis. If you need to make a general enquiry, please see the Contact us page.