scientific article; zbMATH DE number 4147494

zbMATH Open0699.68046MaRDI QIDQ3477945FDOQ3477945

Authors: Ernst W. Mayr, David P. Helmbold 

Publication date: 1990

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

maximum clique problemtransitive orientationsminimum coloring problemtwo processor scheduling problem

Mathematics Subject Classification ID

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

Cited In (4)

• Coloring permutation graphs in parallel
• Title not available (Why is that?)
• Title not available (Why is that?)
• Constant-time parallel recognition of split graphs

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)