The expressive power and complexity of dynamic process graphs

DOI10.1007/3-540-40064-8_22MaRDI QIDQ2766685zbMATH OpenFDO

Authors Andreas Jakoby, Maciej Liśkiewicz, Rüdiger Reischuk

Publication date 9 July 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-40064-8_22

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Recommendations

• Approximating schedules for dynamic process graphs efficiently
• scientific article; zbMATH DE number 2081021
• scientific article; zbMATH DE number 4187099
• scientific article; zbMATH DE number 51650
• Competitive implementation of parallel programs

Cited in

(7)

• Distributed computation of fixed points on dependency graphs
• Replication, refinement \& reachability: complexity in dynamic condition-response graphs
• Process flexibility revisited: the graph expander and its applications
• Static mapping of process graphs
• scientific article; zbMATH DE number 2081021 (Why is no real title available?)
• Some Remarks on Definability of Process Graphs
• Approximating schedules for dynamic process graphs efficiently

This page was built for publication: The expressive power and complexity of dynamic process graphs

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