Scheduling Graphs on Two Processors
- 1 March 1976
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 5 (1) , 73-82
- https://doi.org/10.1137/0205005
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Efficient Planarity TestingJournal of the ACM, 1974
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974
- Set Merging AlgorithmsSIAM Journal on Computing, 1973
- Optimal scheduling for two-processor systemsActa Informatica, 1972
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Optimal Sequencing of Two Equivalent ProcessorsSIAM Journal on Applied Mathematics, 1969
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966