Applications of parallel scheduling to perfect graphs

  • David Helmbold
  • Ernst Mayr
Parallelism And Distributed Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 246)


We combine a parallel algorithm for the two processor scheduling problem, which runs in polylog time on a polynomial number of processors, with an algorithm to find transitive orientations of graphs where they exist. Both algorithms together solve the maximum clique problem and the minimum coloring problem for comparability graphs, and the maximum matching problem for co-comparability graphs. These parallel algorithms can also be used to identify permutation graphs and interval graphs, important subclasses of perfect graphs.


Optimal Schedule Precedence Constraint Interval Graph Comparability Graph Maximum Match 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A. Aho, J. Hopcroft, and J. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, New York, 1974.Google Scholar
  2. [2]
    E.G. Coffman, Jr., and R. Graham. Optimal scheduling for two processor systems. Acta Informatica, 1:200–213, 1972.Google Scholar
  3. [3]
    D. Dolev, E. Upfal, and M. Warmuth. Scheduling trees in parallel. In Bertolazzi, P, Luccio, F. (eds.): VLSI: Algorithms and Architectures. Proceedings of the International Workshop on Parallel Computating and VLSI, pages 1–30, North-Holland, 1985.Google Scholar
  4. [4]
    S. Fortune and J. Wyllie. Parallelism in random access machines. In Proceedings of the 10th Ann. ACM Symp. on Theory of Computing (San Diego, CA), pages 114–118, 1978.Google Scholar
  5. [5]
    M. Fujii, T. Kasami, and K. Ninamiya. Optimal sequencing of two equivalent processors. SIAM J. Appl. Math., 17(4):784–789, 1969.Google Scholar
  6. [6]
    H. Gabow. An almost-linear algorithm for two-processor scheduling. JACM, 29(3):766–780, 1982.Google Scholar
  7. [7]
    H. Gabow and R. Tarjan. A linear time algorithm for special case of disjoint set union. In Proceedings of the 15th Ann. ACM Symp. on Theory of Computing (Boston, Mass.), pages 246–251, 1983.Google Scholar
  8. [8]
    P. Gilmore and A. Hoffman. A characterization of comparability graphs and of interval graphs. Canad. J. Math, 16, 1964.Google Scholar
  9. [9]
    M. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.Google Scholar
  10. [10]
    M. Golumbic. Comparability graphs and a new matroid. J. Combinatorial Theory (B), 22(1):68–90, 1977.CrossRefGoogle Scholar
  11. [11]
    D. Helmbold and E. Mayr. Fast scheduling algorithms on parallel computers. Advances in Computing Research, 1986. to appear.Google Scholar
  12. [12]
    D. Helmbold and E. Mayr. Two processor scheduling is in NC. In Proc. 1986 Aegean Workshop on Computing: VLSI Algorithms and Architectures, July 1986.Google Scholar
  13. [13]
    R. Karp, E. Upfal, and A. Wigderson. Are search and decision problems computationally equivalent? In Proceedings of the 17th Ann. ACM Symp. on Theory of Computing (Providence, RI), pages 465–475, 1985.Google Scholar
  14. [14]
    R. Karp, E. Upfal, and A. Wigderson. Constructing a perfect matching is in random NC. In Proceedings of the 17th Ann. ACM Symp. on Theory of Computing (Providence, RI), pages 22–32, 1985.Google Scholar
  15. [15]
    R. Karp and A. Wigderson. A fast parallel algorithm for the maximal independent set problem. J.ACM, 32(4):762–773, 1985.CrossRefGoogle Scholar
  16. [16]
    D. Kozen, U. Vazirani, and V. Vazirani. NC algorithms for comparability graphs, interval graphs, and testing for unique perfect matching. In 5th Conf. Found. of Software Tech. and Theor. Comp. Sci. (New Dehli), 1985.Google Scholar
  17. [17]
    M. Luby. A simple parallel algorithm for the maximal independent set problem. In Proceedings of the 17th Ann. ACM Symp. on Theory of Computing (Providence, RI), pages 1–10, 1985.Google Scholar
  18. [18]
    K. Mulmuley, U. Vazirani, and V. Vazirani. Parallel algorithms for rank and matching. private communication.Google Scholar
  19. [19]
    C. Papadimitriou and M. Yannakakis. Scheduling interval-ordered tasks. SIAM J. Computing, 8(3), 1979.Google Scholar
  20. [20]
    N. Pippenger. On simultaneous resource bounds. In Proceedings of the 20th IEEE Symp. on Foundations of Computer Science, pages 307–311, 1979.Google Scholar
  21. [21]
    A. Pnueli, A. Lempel, and S. Even. Transitive orientation of graphs and identification of permutation graphs. Can. J. Math., 23(1):160–175, 1971.Google Scholar
  22. [22]
    Y. Shiloach and U. Vishkin. An O(log n) parallel connectivity algorithm. J. Algorithms, 3(1):57–63, 1982.CrossRefGoogle Scholar
  23. [23]
    J. Ullman. NP-complete scheduling problems. J. Comput. System Sci., 10(3):384–393, 1975.Google Scholar
  24. [24]
    U. Vazirani and V. Vazirani. The two-processor scheduling problem is in RNC. In Proceedings of the 17th Ann. ACM Symp. on Theory of Computing (Providence, RI), pages 11–21, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • David Helmbold
    • 1
  • Ernst Mayr
    • 1
  1. 1.Stanford UniversityUSA

Personalised recommendations