Regular article
An NC recognition algorithm for cographs

https://doi.org/10.1016/0743-7315(91)90111-LGet rights and content

Abstract

The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. In this paper we present two new characterizations of the cographs and show how to use them for the purpose of producing a parallel recognition algorithm for this class of graphs. In addition, if the graph under investigation turns out to be a cograph, our algorithm constructs its corresponding cotree. With an arbitrary graph G with n vertices and m edges as input, the proposed algorithm runs in O(log n) time using O((n2 + mn)/log n) processors on an EREW parallel random access machine.

References (29)

  • E. Dekel et al.

    Binary trees and parallel scheduling algorithms

  • A. Edenbrandt

    Combinatorial problems in matrix computation

  • D. Helmbold et al.

    Perfect graphs and parallel algorithms

  • Kirkpatrick, D. G., and Przytycka, T. Parallel recognition of cographs and cotree construction. The University of...
  • Cited by (18)

    • Efficient parallel recognition of cographs

      2005, Discrete Applied Mathematics
    • Parallel algorithms for Hamiltonian problems on quasi-threshold graphs

      2004, Journal of Parallel and Distributed Computing
    View all citing articles on Scopus

    This work was supported by the National Science Foundation under Grant CCR-8909996.

    View full text