Polynomial time preemptive sum-multicoloring on paths
From MaRDI portal
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) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35)
Recommendations
This page was built for publication: Polynomial time preemptive sum-multicoloring on paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716832)