Shorter paths to graph algorithms

7Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We illustrate the use of formal languages and relations in compact formal derivations of some graph algorithms. © 1994.

Cite

CITATION STYLE

APA

Möller, B., & Russling, M. (1994). Shorter paths to graph algorithms. Science of Computer Programming, 22(1–2), 157–180. https://doi.org/10.1016/0167-6423(94)90011-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free