AbstractWe survey an algebra of formal languages suitable to deal with graph algorithms. As an example of its use we derive a general scheme for layer-oriented graph traversal. This general scheme is then applied to a reachability and a shortest path problem
International audienceWe consider standard algorithms of finite graph theory, like for instance shor...
We calculate two iterative, polynomial-time graph algorithms from the literature: a dominance algori...
The representation of problems and systems is important. The more unificated representation we get, ...
AbstractWe survey an algebra of formal languages suitable to deal with graph algorithms. As an examp...
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...
Using an algebra of paths we present abstract algebraic derivations for two problem classes concerni...
Using an algebra of paths we present abstract algebraic derivations for two problem classes concerni...
Using an algebra of paths we present abstract algebraic derivations for two problem classes concerni...
AbstractA calculational derivation is given of two abstract path algorithms. The first is an all-pai...
A calculational derivation is given of two abstract path algorithms. The first is an all-pairs algor...
Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete la...
We introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds...
We introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds...
Graph extension grammars provide a way to define graph languages. They consist of a regular tree gra...
International audienceWe consider standard algorithms of finite graph theory, like for instance shor...
We calculate two iterative, polynomial-time graph algorithms from the literature: a dominance algori...
The representation of problems and systems is important. The more unificated representation we get, ...
AbstractWe survey an algebra of formal languages suitable to deal with graph algorithms. As an examp...
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...
Using an algebra of paths we present abstract algebraic derivations for two problem classes concerni...
Using an algebra of paths we present abstract algebraic derivations for two problem classes concerni...
Using an algebra of paths we present abstract algebraic derivations for two problem classes concerni...
AbstractA calculational derivation is given of two abstract path algorithms. The first is an all-pai...
A calculational derivation is given of two abstract path algorithms. The first is an all-pairs algor...
Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete la...
We introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds...
We introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds...
Graph extension grammars provide a way to define graph languages. They consist of a regular tree gra...
International audienceWe consider standard algorithms of finite graph theory, like for instance shor...
We calculate two iterative, polynomial-time graph algorithms from the literature: a dominance algori...
The representation of problems and systems is important. The more unificated representation we get, ...
DOI
Add to ORKG