Linear-time graph algorithms in GP 2
From MaRDI portal
Recommendations
Cites work
- Efficient graph rewriting and its implementation
- From imperative to rule-based graph programs
- Graph and model transformation. General framework and applications
- Hoare-style verification of graph programs
- 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 194559 (Why is no real title available?)
- The algorithm design manual
- Towards critical pair analysis for the graph programming language GP 2
- Verifying monadic second-order properties of graph programs
- Visual modelling of complex systems: towards an abstract machine for PORGY
Cited in
(7)- scientific article; zbMATH DE number 7456056 (Why is no real title available?)
- On the graph traversal method for evaluating linear binary-chain programs
- Finding the right way to Rome: effect-oriented graph transformation
- Mechanised DPO theory: uniqueness of derivations and Church-Rosser theorem
- Causality in higher order process theories
- Rule-based graph programs matching the time complexity of imperative algorithms
- ILIGRA: an efficient inverse line graph algorithm
This page was built for publication: Linear-time graph algorithms in GP 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875357)
