Mixed Graph Colouring as Scheduling a Partially Ordered Set of Interruptible Multi-Processor Tasks with Integer Due Dates

Evangelina I. Mihova, Yuri N. Sotskov

Open source

DOI
10.3390/a17070299
Published
2024-07-06
Container
Algorithms
Publisher
MDPI AG
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.3390/a17070299,
  title = {Mixed Graph Colouring as Scheduling a Partially Ordered Set of Interruptible Multi-Processor Tasks with Integer Due Dates},
  author = {Evangelina I. Mihova and Yuri N. Sotskov},
  year = {2024},
  journal = {Algorithms},
  doi = {10.3390/a17070299},
  url = {https://doi.org/10.3390/a17070299}
}

RIS

TY  - JOUR
TI  - Mixed Graph Colouring as Scheduling a Partially Ordered Set of Interruptible Multi-Processor Tasks with Integer Due Dates
AU  - Evangelina I. Mihova
AU  - Yuri N. Sotskov
PY  - 2024
JO  - Algorithms
DO  - 10.3390/a17070299
UR  - https://doi.org/10.3390/a17070299
ER  - 

APA

Mihova, E. I., & Sotskov, Y. N. (2024). Mixed Graph Colouring as Scheduling a Partially Ordered Set of Interruptible Multi-Processor Tasks with Integer Due Dates. Algorithms. https://doi.org/10.3390/a17070299

Source records