SCHEDULING INTERVAL ORDERS IN PARALLEL
From MaRDI portal
Publication:4820141
DOI10.1080/10637199608915542zbMATH Open1049.68535OpenAlexW2149204009MaRDI QIDQ4820141FDOQ4820141
Publication date: 6 October 2004
Published in: Parallel Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10637199608915542
Cites Work
- Incidence matrices and interval graphs
- Optimal scheduling for two-processor systems
- Scheduling Interval-Ordered Tasks
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Parallel Merge Sort
- Parallelism in random access machines
- NP-complete scheduling problems
- Title not available (Why is that?)
- Computer-Aided complexity classification of combinational problems
- Title not available (Why is that?)
- Two Processor Scheduling is in $\mathcal{NC}$
- Binary Trees and Parallel Scheduling Algorithms
- Fast Parallel Algorithms for Chordal Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: SCHEDULING INTERVAL ORDERS IN PARALLEL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820141)
