scientific article; zbMATH DE number 4049080

MaRDI QIDQ3785968zbMATH OpenFDO

Authors Ernst W. Mayr, David P. Helmbold

Publication date 1987

zbMATH Keywords

\({\mathcal N}{\mathcal C}\) algorithmsco- comparability graphscomparability graphsinterval graphsmaximum cliquemaximum matchingminimum coloringparallel algorithmpermutation graphstransitive orientations of graphstwo processor scheduling problem

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of software (68N99) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Publication:3477945
• scientific article; zbMATH DE number 934540
• Parallel algorithms for solution of problems in scheduling theory
• Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
• scientific article; zbMATH DE number 1760037
• Efficient parallel algorithms for graph problems
• Parallel algorithms for permutation graphs
• scientific article; zbMATH DE number 3972201
• Efficient parallel algorithms for permutation graphs

Cited in

(8)

• On two-processor scheduling and maximum matching in permutation graphs
• An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs
• Parallel execution of schedules with random dependency graph
• scientific article; zbMATH DE number 4147494 (Why is no real title available?)
• SCHEDULING INTERVAL ORDERS IN PARALLEL
• scientific article; zbMATH DE number 5263424 (Why is no real title available?)
• scientific article; zbMATH DE number 2247684 (Why is no real title available?)
• Comparability graph augmentation for some multiprocessor scheduling problems

This page was built for publication:

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