Deriving a class of layer-oriented graph algorithms

DOI10.1016/0167-6423(95)00030-5zbMath0853.68142OpenAlexW2032962110MaRDI QIDQ1916362

Martin Russling

Publication date: 2 January 1997

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

Full work available at URL: https://doi.org/10.1016/0167-6423(95)00030-5

zbMATH Keywords

graph algorithmsalgebra of formal languages

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 (3)

Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures ⋮ An algebraic framework for multi-objective and robust variants of path problems ⋮ Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures

This page was built for publication: Deriving a class of layer-oriented graph algorithms