Scheduling Graphs on Two Processors
From MaRDI portal
Publication:4094404
Recommendations
Cited in
(23)- scientific article; zbMATH DE number 5263424 (Why is no real title available?)
- ON CONSIDERING COMMUNICATION IN SCHEDULING TASK GRAPHS ON PARALLEL PROCESSORS
- scientific article; zbMATH DE number 1743973 (Why is no real title available?)
- Scheduling of pipelined operator graphs
- Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length
- Graph searches and their end vertices
- Optimal shooting: Characterizations and applications
- Scheduling Opposing Forests
- scientific article; zbMATH DE number 4113979 (Why is no real title available?)
- Multi-processor scheduling and expanders
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- A linear-time algorithm for a special case of disjoint set union
- Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler
- Scheduling Flat Graphs
- A linear-time recognition algorithm for interval dags
- On two-processor scheduling and maximum matching in permutation graphs
- Application of digraph theory to process scheduling
- Multiprocessor scheduling and combinatorial configurations
- scientific article; zbMATH DE number 1756650 (Why is no real title available?)
- scientific article; zbMATH DE number 1264424 (Why is no real title available?)
- Planar stage graphs: Characterizations and applications
- Scheduling tasks with communication delays on parallel processors
- ON OPTIMAL LOOP UNROLLING IN TWO-PROCESSOR SCHEDULING
This page was built for publication: Scheduling Graphs on Two Processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4094404)