Rule-based graph programs matching the time complexity of imperative algorithms

DOI10.46298/LMCS-22(2:20)2026MaRDI QIDQ7254997zbMATH OpenFDO

Authors Ziad Ismaili Alaoui, Detlef Plump

Publication date 29 May 2026

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/LMCS-22(2:20)2026

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 2016072 (Why is no real title available?)
• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• scientific article; zbMATH DE number 7649899 (Why is no real title available?)
• A small-step operational semantics for GP 2
• Digraphs
• Efficient graph rewriting and its implementation
• Graph transformation. 9th international conference, ICGT 2016, in memory of Hartmut Ehrig, held as part of STAF 2016, Vienna, Austria, July 5--6, 2016. Proceedings
• Linear-time graph programs without preconditions
• Strategic port graph rewriting: an interactive modelling framework

This page was built for publication: Rule-based graph programs matching the time complexity of imperative algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7254997)