- Algorithms
- >
- Combinatorial algorithms
- >
- Graph algorithms
- >
- Graph rewriting

- Applied mathematics
- >
- Algorithms
- >
- Graph algorithms
- >
- Graph rewriting

- Applied mathematics
- >
- Theoretical computer science
- >
- Formal languages
- >
- Graph rewriting

- Applied mathematics
- >
- Theoretical computer science
- >
- Graph theory
- >
- Graph rewriting

- Applied mathematics
- >
- Theoretical computer science
- >
- Rewriting systems
- >
- Graph rewriting

- Combinatorics
- >
- Combinatorial algorithms
- >
- Graph algorithms
- >
- Graph rewriting

- Combinatorics
- >
- Combinatorics on words
- >
- Formal languages
- >
- Graph rewriting

- Computational mathematics
- >
- Combinatorial algorithms
- >
- Graph algorithms
- >
- Graph rewriting

- Computational mathematics
- >
- Computational problems in graph theory
- >
- Graph algorithms
- >
- Graph rewriting

- Computational problems
- >
- Computational problems in graph theory
- >
- Graph algorithms
- >
- Graph rewriting

- Deductive reasoning
- >
- Metalogic
- >
- Formal languages
- >
- Graph rewriting

- Discrete mathematics
- >
- Combinatorics
- >
- Graph theory
- >
- Graph rewriting

- Fields of mathematics
- >
- Combinatorics
- >
- Graph theory
- >
- Graph rewriting

- Fields of mathematics
- >
- Discrete mathematics
- >
- Graph theory
- >
- Graph rewriting

- Fields of mathematics
- >
- Mathematical logic
- >
- Formal languages
- >
- Graph rewriting

- Graph theory
- >
- Computational problems in graph theory
- >
- Graph algorithms
- >
- Graph rewriting

- Mathematical analysis
- >
- Mathematical relations
- >
- Graph theory
- >
- Graph rewriting

- Mathematical concepts
- >
- Mathematical relations
- >
- Graph theory
- >
- Graph rewriting

- Mathematical logic
- >
- Algorithms
- >
- Graph algorithms
- >
- Graph rewriting

- Mathematics
- >
- Fields of mathematics
- >
- Graph theory
- >
- Graph rewriting

- Philosophy of mathematics
- >
- Formalism (deductive)
- >
- Formal languages
- >
- Graph rewriting

- Philosophy of mathematics
- >
- Mathematical logic
- >
- Formal languages
- >
- Graph rewriting

- Predicate logic
- >
- Mathematical relations
- >
- Graph theory
- >
- Graph rewriting

- Theoretical computer science
- >
- Algorithms
- >
- Graph algorithms
- >
- Graph rewriting

Linear graph grammar

In computer science, a linear graph grammar (also a connection graph reduction system or a port graph grammar) is a class of graph grammar on which nodes have a number of ports connected together by e

Term graph

A term graph is a representation of an expression in a formal language as a generalized graph whose vertices are terms. Term graphs are a more powerful form of representation than expression trees bec

Graph rewriting

In computer science, graph transformation, or graph rewriting, concerns the technique of creating a new graph out of an original graph algorithmically. It has numerous applications, ranging from softw

VIATRA

VIATRA is an open-source model transformation framework based on the Eclipse Modeling Framework (EMF) and hosted by the Eclipse Foundation. VIATRA supports the development of model transformations wit

Tom (pattern matching language)

Tom is a programming language particularly well-suited for programming various transformations on tree structures and XML-based documents. Tom is a language extension which adds new matching primitive

GReAT

Graph Rewriting and Transformation (GReAT) is a Model Transformation Language (MTL) for available in the GME environment. GReAT has a rich pattern specification sublanguage, a graph transformation sub

GrGen

GrGen.NET is a software development tool that offers programming languages (domain-specific languages) that are optimized for the processing of graph structured data.The core of the languages consists

Double pushout graph rewriting

In computer science, double pushout graph rewriting (or DPO graph rewriting) refers to a mathematical framework for graph rewriting. It was introduced as one of the first algebraic approaches to graph

Graph reduction

In computer science, graph reduction implements an efficient version of non-strict evaluation, an evaluation strategy where the arguments to a function are not immediately evaluated. This form of non-

Attributed graph grammar

In computer science, an attributed graph grammar is a class of graph grammar that associates vertices with a set of attributes and rewrites with functions on attributes. In the algebraic approach to g

Single pushout graph rewriting

In computer science, a single pushout graph rewriting or SPO graph rewriting refers to a mathematical framework for graph rewriting, and is used in contrast to the double-pushout approach of graph rew

© 2023 Useful Links.