scientific article; zbMATH DE number 4147494

MaRDI QIDQ3477945zbMATH OpenFDO

Authors Ernst W. Mayr, David P. Helmbold

Publication date 1990

zbMATH Keywords

maximum clique problemminimum coloring problemtransitive orientationstwo processor scheduling problem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4049080
• On two-processor scheduling and maximum matching in permutation graphs
• scientific article; zbMATH DE number 3888924
• Parallel algorithms for permutation graphs
• scientific article; zbMATH DE number 176752

Cited in

(5)

• Constant-time parallel recognition of split graphs
• Coloring permutation graphs in parallel
• scientific article; zbMATH DE number 4049080 (Why is no real title available?)
• scientific article; zbMATH DE number 1836382 (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 Q3477945)