Rule-Based Graph Programs Matching the Time Complexity of Imperative Algorithms

Plump, Detlef orcid.org/0000-0002-1148-822X and Ismaili Alaoui, Ziad (2026) Rule-Based Graph Programs Matching the Time Complexity of Imperative Algorithms. Logical Methods in Computer Science. 20:1-20:40. ISSN: 1860-5974

Metadata

Item Type: Article
Authors/Creators:
Copyright, Publisher and Additional Information:

© Z. Ismaili Alaoui and D. Plump
Dates:
  • Accepted: 15 January 2025
  • Published: 20 May 2026
Institution: The University of York
Academic Units: The University of York > Faculty of Sciences (York) > Computer Science (York)
Date Deposited: 10 Dec 2025 11:10
Last Modified: 27 May 2026 09:00
Published Version: https://doi.org/10.46298/lmcs-22(2:20)2026
Status: Published
Refereed: Yes
Identification Number: 10.46298/lmcs-22(2:20)2026
Open Archives Initiative ID (OAI ID):

Download

Published Version

Filename: 2501.09144.pdf

Description: Rule-Based Graph Programs Matching the Time Complexity of Imperative Algorithms

Licence: CC-BY 2.5

CLICK TO DOWNLOAD [thumbnail of Rule-Based Graph Programs Matching the Time Complexity of Imperative Algorithms]

Export

Statistics

View Altmetric information about this item.


CORE (COnnecting REpositories)