## Scheduling parallel I/O operations

- Ravi Jain, Kiran Somalwar, John Werth, James C. Browne
- SIGARCH Computer Architecture News
- 1993

- Published 1995 in Inf. Process. Lett.
DOI:10.1016/0020-0190(95)00013-3

The problem of edge coloring a bipartite graph is to color the edges so that adjacent edges receive di erent colors An optimal algorithm uses the minimum number of colors to color the edges We consider several approximation algorithms for edge coloring bipartite graphs and show tight bounds on the number of colors they use in the worst case We also present… CONTINUE READING

### Presentations referencing similar topics