Shorter paths to graph algorithms

DOI10.1016/0167-6423(94)90011-6zbMath0813.68144OpenAlexW1534679741MaRDI QIDQ1330455

Martin Russling, Bernhard Möller

Publication date: 21 July 1994

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/20645

zbMATH Keywords

graph algorithms

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (2)

Combining relational calculus and the Dijkstra-Gries method for deriving relational programs ⋮ Assertions and recursions

This page was built for publication: Shorter paths to graph algorithms