Approximating schedules for dynamic process graphs efficiently
From MaRDI portal
Recommendations
Cites work
- A note on succinct representations of graphs
- Succinct representations of graphs
- The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
- The expressive power and complexity of dynamic process graphs
- Towards an Architecture-Independent Analysis of Parallel Algorithms
Cited in
(6)- Temporal communication graphs: Lamport's process-time graphs augmented for the purpose of mapping and scheduling
- The expressive power and complexity of dynamic process graphs
- Process flexibility revisited: the graph expander and its applications
- scientific article; zbMATH DE number 4178740 (Why is no real title available?)
- The complexity of some basic problems for dynamic process graphs
- scientific article; zbMATH DE number 1512197 (Why is no real title available?)
This page was built for publication: Approximating schedules for dynamic process graphs efficiently
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876729)