A calculational derivation is given of two abstract path algorithms. The first is an all-pairs algorithm, two well-known instances of which are Warshall's (reachability) algorithm and Floyd's shortest-path algorithm; instances of the second are Dijkstra's shortest-path algorithm and breadth-first/depth-first search of a directed graph. The basis for the derivations is the algebra of regular languages
Motivated by the large number of vertices that future technologies will put in the front of path-sea...
This thesis develops an algebraic theory for path problems such as that of finding the shortest or m...
International audienceThe computation of the k-shortest paths, should they be elementary or not, has...
A calculational derivation is given of two abstract path algorithms. The first is an all-pairs algor...
AbstractA calculational derivation is given of two abstract path algorithms. The first is an all-pai...
We calculate two iterative, polynomial-time graph algorithms from the literature: a dominance algori...
In this paper, we report on our own experience in studying a fundamental problem on graphs: all pair...
textabstractIn this paper we present a general framework for shortest path algorithms, including amo...
The problem of finding the shortest path from a path or graph has been quite widely discussed. There...
Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete la...
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 ...
One concern in making the calculation of algorithms a formal mathematical activity is succinctness o...
AbstractWe illustrate the use of formal languages and relations in compact formal derivations of som...
International audienceWe consider standard algorithms of finite graph theory, like for instance shor...
Motivated by the large number of vertices that future technologies will put in the front of path-sea...
This thesis develops an algebraic theory for path problems such as that of finding the shortest or m...
International audienceThe computation of the k-shortest paths, should they be elementary or not, has...
A calculational derivation is given of two abstract path algorithms. The first is an all-pairs algor...
AbstractA calculational derivation is given of two abstract path algorithms. The first is an all-pai...
We calculate two iterative, polynomial-time graph algorithms from the literature: a dominance algori...
In this paper, we report on our own experience in studying a fundamental problem on graphs: all pair...
textabstractIn this paper we present a general framework for shortest path algorithms, including amo...
The problem of finding the shortest path from a path or graph has been quite widely discussed. There...
Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete la...
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 ...
One concern in making the calculation of algorithms a formal mathematical activity is succinctness o...
AbstractWe illustrate the use of formal languages and relations in compact formal derivations of som...
International audienceWe consider standard algorithms of finite graph theory, like for instance shor...
Motivated by the large number of vertices that future technologies will put in the front of path-sea...
This thesis develops an algebraic theory for path problems such as that of finding the shortest or m...
International audienceThe computation of the k-shortest paths, should they be elementary or not, has...
DOI
Add to ORKG