SCHEDULING INTERVAL ORDERS IN PARALLEL (Q4820141)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 2106728

Language	Label	Description	Also known as
English	SCHEDULING INTERVAL ORDERS IN PARALLEL	scientific article; zbMATH DE number 2106728

Statements

scholarly article

0 references

SCHEDULING INTERVAL ORDERS IN PARALLEL (English)

0 references

0 references

Parallel Algorithms and Applications

0 references

publication date

6 October 2004

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/10637199608915542

0 references

Optimal scheduling for two-processor systems

0 references

Parallel Merge Sort

0 references

Binary Trees and Parallel Scheduling Algorithms

0 references

0 references

0 references

Parallelism in random access machines

0 references

Incidence matrices and interval graphs

0 references

Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

0 references

0 references

Two Processor Scheduling is in $\mathcal{NC}$

0 references

0 references

Computer-Aided complexity classification of combinational problems

0 references

Fast Parallel Algorithms for Chordal Graphs

0 references

Scheduling Interval-Ordered Tasks

0 references

0 references

NP-complete scheduling problems

0 references

Identifiers

zbMATH Open document ID

0 references

10.1080/10637199608915542

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4820141

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4820141&oldid=34371893"