Parallel algorithms for cographs recognition and applications

  • Gur Saran Adhar
  • Shietung Peng
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 382)


Cograph arise in such application areas as examination scheduling and automatic clustering of index terms. It is shown that recognition, transitive orientation, maximum node weighted clique, minimum node coloring, minimum weight dominating set, minimum fill-in and isomorphism for cographs is in NC. The model of computation is CRCW P-RAM.


parity graph cograph minimal chain perfect graph NC algorithm transitive orientation weighted clique dominating set mimum fill-in isomorphism 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AEd85]
    A. Edenbrandt. Combinatorial Problems in Matrix Computations. Technical Report, Cornell University, Ithaca, 1985.Google Scholar
  2. [Cha85]
    N Chandrasekharan. New chracterizations and Algorithmic Studies on Chordal graphs and k-trees. Technical Report, School of Automation,IISc, Bangalore,India, 1985.Google Scholar
  3. [CLB81]
    D.G. Corneil, H Lerchs, and L.S. Burlingham. Complement reducible graphs. Discrete Applied Mathematics, 3:163–174, 1981.CrossRefGoogle Scholar
  4. [CP84]
    D.G. Corneil and Y Perl. Clustering and domination in perfect graphs. Discrete Applied Mathematics, 9:27–39, 1984.CrossRefGoogle Scholar
  5. [CPS84]
    D.G. Corneil, Y Perl, and L.K. Stewart. Cographs: recognition, applications and algorithms. In Proc. 15th Southeastern Conference on Combinatorics, Graph Theory and Computing, 1984.Google Scholar
  6. [CPS85]
    D.G. Corneil, Y Perl, and L.K. Stewart. A linear recognition algorithm for cographs. SIAM J. COMP., 14(4):926–934, 1985.CrossRefGoogle Scholar
  7. [Fei86]
    Joan Feigenbaum. Product graphs:some algorithms and combinatorial results. Technical Report, Stanford University, 1986.Google Scholar
  8. [HM86]
    David Helmbold and Ernst Mayr. Perfect graphs and parallel algorithms. In Proc. of 1986 Intl.Conf.on Parallel Processing, 1986.Google Scholar
  9. [JRo70]
    Donald J. Rose. Triangualated graphs and the elimination process. Journal of Mathematical analysis and applications, 32:597–609, 1970.Google Scholar
  10. [JTS76]
    Donald J.Rose, R.Endre Tarjan, and George S.Lueker. Algorithmic aspects of vertex elimination on graphs. SIAM J. COMP., 5(2), June 1976.Google Scholar
  11. [Jun78]
    H.A. Jung. On a class of posets and the coresponding comparability graphs. Journal of Combinatorial Theory, 24:125–133, 1978.Google Scholar
  12. [Kle88]
    Philip N. Klein. Efficient parallel algorithms for chordal graphs. FOCS 88, 1988.Google Scholar
  13. [LH85]
    Gary L.Miller and John H.Reif. Parallel tree contraction and its application. In Proc. of 26th FOCS, pages 478–489, 1985.Google Scholar
  14. [MCG80]
    M.C.Golumbic. Algorithmic Graph Theory and Perfect Garphs. Academic Press, 1980.Google Scholar
  15. [NNA87]
    Joseph Naor, Moni Naor, and Alejandro A.Schaffer. Fast parallel algorithms for chordal graphs. ACM Symposium on theory of computing, 354–364, 1987.Google Scholar
  16. [Shi84]
    D.R. Shier. Some aspects of perfect elimination orderings in chordal graphs. Discrete Applied Mathematics, 7:325–331, 1984.Google Scholar
  17. [Sum74]
    D.P. Sumner. Dacey graphs. Journal of Aust. Math. Soc., 18:492–502, 1974.Google Scholar
  18. [SV82]
    Yossi Shiloach and Uzi Vishkin. An o(log n) parallel connectivity algorithm. Journal of Algorithms., 3:57–67, 1982.Google Scholar
  19. [Tar75]
    Robert E. Tarjan. Garph Theory and Gaussian Elimination. Technical Report, Stanford University, 1975.Google Scholar
  20. [TY84]
    R. Tarjan and M. Yannakakis. Simple linear algorithms to test the chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs. SIAM J. COMP., 13:566–579, 1984.Google Scholar
  21. [VTL82]
    Jacobo Valdes, R.E. Tarjan, and E.L. Lawler. The recognition of series parallel digraphs. SIAM J. COMP., 11(2):298–313, 1982.Google Scholar
  22. [Yan81]
    Mihalis Yannakakis. Computing the minimum fill-in is np-complete. SIAM J. ALGEBRIC and DISC. MATH., 2:77–79, 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Gur Saran Adhar
    • 1
  • Shietung Peng
    • 1
  1. 1.Computer Science DepartmentUniversity of Maryland Baltimore County, and UMIACS College ParkUSA

Personalised recommendations