Approximating schedules for dynamic process graphs efficiently

DOI10.1016/j.jda.2004.04.007zbMath1118.68584OpenAlexW2006732289MaRDI QIDQ876729

Andreas Jakoby, K. Ruediger Reischuk, Maciej Liśkiewicz

Publication date: 26 April 2007

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2004.04.007

zbMATH Keywords

overlapschedulingapproximationparallel processingdynamic process graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
• Towards an Architecture-Independent Analysis of Parallel Algorithms
• Succinct representations of graphs
• A note on succinct representations of graphs

This page was built for publication: Approximating schedules for dynamic process graphs efficiently