scientific article
From MaRDI portal
Publication:3785968
zbMath0643.68087MaRDI QIDQ3785968
Ernst W. Mayr, David P. Helmbold
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
parallel algorithmmaximum matchinginterval graphsmaximum cliquecomparability graphspermutation graphsminimum coloringtwo processor scheduling problem\({\mathcal N}{\mathcal C}\) algorithmsco- comparability graphstransitive orientations of graphs
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) Theory of software (68N99)
Related Items (2)
SCHEDULING INTERVAL ORDERS IN PARALLEL ⋮ An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs
This page was built for publication:
