We illustrate the use of formal languages and relations in compact formal derivations of some graph algorithms.
CITATION STYLE
Möller, B., & Russling, M. (1993). Shorter paths to graph algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 669 LNCS, pp. 250–268). Springer Verlag. https://doi.org/10.1007/3-540-56625-2_17
Mendeley helps you to discover research relevant for your work.