Scheduling Graphs on Two Processors
From MaRDI portal
Publication:4094404
DOI10.1137/0205005zbMath0328.68057OpenAlexW2067945058WikidataQ56865895 ScholiaQ56865895MaRDI QIDQ4094404
Publication date: 1976
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0205005
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items (11)
On two-processor scheduling and maximum matching in permutation graphs ⋮ Scheduling tasks with communication delays on parallel processors ⋮ ON CONSIDERING COMMUNICATION IN SCHEDULING TASK GRAPHS ON PARALLEL PROCESSORS ⋮ ON OPTIMAL LOOP UNROLLING IN TWO-PROCESSOR SCHEDULING ⋮ Graph searches and their end vertices ⋮ Planar stage graphs: Characterizations and applications ⋮ A linear-time recognition algorithm for interval dags ⋮ Optimal shooting: Characterizations and applications ⋮ Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms ⋮ Scheduling Opposing Forests ⋮ A linear-time algorithm for a special case of disjoint set union
This page was built for publication: Scheduling Graphs on Two Processors
