Advertisement

Using maximal independent sets to solve problems in parallel

  • Takayoshi Shoudai
  • Satoru Miyano
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 570)

Abstract

By using an O((log n)2) time EREW PRAM algorithm for a maximal independent set problem (MIS), we show the following two results: (1) Given a graph, the maximal vertex-induced subgraph satisfying a hereditary graph property π can be found in time 0λ(π)Tπ(n)(log n)2) using a polynomial number of processors, where λ(π) is the maximum of diameters of minimal graphs violating π and Tπ(n) is the time needed to decide whether a graph with n vertices satisfies π. (2) Given a family C = c1,...,c m of subsets of a finite set S = 1,..., n with S = (U i=1 m ci, a minimal set cover for S can be computed on an EREW PRAM in time O(αΒ(log(n + m))2) using a polynomial number of processors, where α=max{¦ci,¦ ¦i=1,..., m and Β = max{¦dj¦ ¦j = 1,..., n.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    B. Berger, J. Rompel and P.W. Shor, Efficient NC algorithm for set cover with application to learning and geometry, Proc. 30th IEEE FOCS (1989) 54–59.Google Scholar
  2. [2]
    S.A. Cook, Taxonomy of problems with fast parallel algorithms, Inform. Contr. 64 (1985) 2–22.Google Scholar
  3. [3]
    M. Goldberg and T. Spencer, A new parallel algorithm for the maximal independent set problem, SIAM J. comput. 18 (1989) 419–427.Google Scholar
  4. [4]
    R.M. Karp and A. Wigderson, A fast parallel algorithm for the maximal independent set problem, J. Assoc. Comput. Mach. 32 (1985) 762–773.Google Scholar
  5. [5]
    M. Luby, A simple parallel algorithm for the maximal independent set problem, Proc. 17th ACM STOC (1985) 1–10.Google Scholar
  6. [6]
    S. Miyano, The lexicographically first maximal subgraph problems: P-completeness and NC algorithms, Math. Systems Theory 22 (1989) 47–73.Google Scholar
  7. [7]
    S. Miyano, S. Shiraishi and T. Shoudai, A list of P-complete problems, RIFIS-TR-CS-17, Research Institute of Fundamental Information Science, Kyushu University, 1989 (revised in December, 1990).Google Scholar
  8. [8]
    T. Shoudai and S. Miyano, Bounded degree maximal subgraph problems are in NC, Proc. Toyohashi Symposium on Theoretical Computer Science (1990) 97–101.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Takayoshi Shoudai
    • 1
  • Satoru Miyano
    • 2
  1. 1.Department of Control Engineering and ScienceKyushu Institute of TechnologyIizukaJapan
  2. 2.Research Institute of Fundamental Information ScienceKyushu University 33FukuokaJapan

Personalised recommendations