Deriving a class of layer-oriented graph algorithms

DOI10.1016/0167-6423(95)00030-5MaRDI QIDQ1916362zbMATH OpenOpenAlexFDO

Authors 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

algebra of formal languagesgraph 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)

Recommendations

• scientific article; zbMATH DE number 876677
• scientific article; zbMATH DE number 1210362
• Calculating path algorithms
• scientific article; zbMATH DE number 512947

Cited in

(10)

• Width-restricted layering of acyclic digraphs with consideration of dummy nodes
• Layered graph approaches for combinatorial optimization problems
• Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
• Simple rectangle-based functional programs for computing reflexive-transitive closures
• An algebraic framework for multi-objective and robust variants of path problems
• scientific article; zbMATH DE number 1547155 (Why is no real title available?)
• scientific article; zbMATH DE number 876677 (Why is no real title available?)
• Traversing Layered Graphs Using the Work Function Algorithm
• A Parametrized Analysis of Algorithms on Hierarchical Graphs
• An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1916362)