DOIAbstract
We illustrate the use of formal languages and relations in compact formal derivations of some graph algorithms
We illustrate the use of formal languages and relations in compact formal derivations of some graph algorithms
International audienceWe study logics expressing properties of paths in graphs that are tailored to ...
We investigate sequential derivation languages associated with graph grammars, as a loose generalisa...
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Rela...
We illustrate the use of formal languages and relations in compact formal derivations of some graph ...
AbstractWe illustrate the use of formal languages and relations in compact formal derivations of som...
We introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds...
AbstractWe survey an algebra of formal languages suitable to deal with graph algorithms. As an examp...
We introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds...
Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete la...
The field of graph structure theory was given life by the Graph Minors Project of Robertson and Seym...
International audienceWe consider standard algorithms of finite graph theory, like for instance shor...
AbstractA calculational derivation is given of two abstract path algorithms. The first is an all-pai...
AbstractCurtis and Lowe (S. Curtis, G. Lowe, Proofs with graphs, Sci. Comput. Program. 26 (1996) 197...
This thesis concerns the time and space efficiency of programs in GP 2, a rule-based graph transform...
Graph databases make use of logics that combine traditional first-order features with navigation on ...
International audienceWe study logics expressing properties of paths in graphs that are tailored to ...
We investigate sequential derivation languages associated with graph grammars, as a loose generalisa...
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Rela...
We illustrate the use of formal languages and relations in compact formal derivations of some graph ...
AbstractWe illustrate the use of formal languages and relations in compact formal derivations of som...
We introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds...
AbstractWe survey an algebra of formal languages suitable to deal with graph algorithms. As an examp...
We introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds...
Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete la...
The field of graph structure theory was given life by the Graph Minors Project of Robertson and Seym...
International audienceWe consider standard algorithms of finite graph theory, like for instance shor...
AbstractA calculational derivation is given of two abstract path algorithms. The first is an all-pai...
AbstractCurtis and Lowe (S. Curtis, G. Lowe, Proofs with graphs, Sci. Comput. Program. 26 (1996) 197...
This thesis concerns the time and space efficiency of programs in GP 2, a rule-based graph transform...
Graph databases make use of logics that combine traditional first-order features with navigation on ...
International audienceWe study logics expressing properties of paths in graphs that are tailored to ...
We investigate sequential derivation languages associated with graph grammars, as a loose generalisa...
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Rela...
Add to ORKG