TY  - JOUR
A1  - Möller, Bernhard
A1  - Russling, Martin
T1  - Shorter paths to graph algorithms
T2  - Lecture Notes in Computer Science
N2  - We illustrate the use of formal languages and relations in compact formal derivations of some graph algorithms.
Y1  - 1993
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/19246
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-192466
VL  - 669
SP  - 250
EP  - 268
PB  - Springer
ER  -