Advertisement

Parallelizability of some P-complete problems

  • Akihiro Fujiwara
  • Michiko Inoue
  • Toshimitsu Masuzawa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1800)

Abstract

In this paper, we consider parallelizability of some P-complete problems. First we propose a parameter which indicates parallelizability for a convex layers problem. We prove P-completeness of the problem and propose a cost optimal parallel algorithm, according to the parameter. Second we consider a lexicographically first maximal 3 sums problem. We prove P-completeness of the problem by reducing a lexicographically first maximal independent set problem, and propose two cost optimal parallel algorithms for related problems. The above results show that some P-complete problems have efficient cost optimal parallel algorithms.

Keywords

Convex Hull Parallel Algorithm Adjacent Vertex Input Graph Sequential Algorithm 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    B. Chazelle. On the convex layers of a planar set. IEEE Transactions on Information Theory, IT-31(4):509–517, 1985.CrossRefMathSciNetGoogle Scholar
  2. 2.
    D. Z. Chen. Efficient geometric algorithms on the EREW PRAM. IEEE transactions on parallel and distributed systems, 6(1):41–47, 1995.CrossRefGoogle Scholar
  3. 3.
    W. Chen. Parallel Algorithm and Data Structures for Geometric Problems. PhD thesis, Osaka University, 1993.Google Scholar
  4. 4.
    R. Cole. Parallel merge sort. SIAM Journal of Computing, 17(4):770–785, 1988.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    A. Dessmark, A. Lingas, and A. Maheshwari. Multi-list ranking: complexity and applications. In 10th Annual Symposium on Theoretical Aspects of Computer Science (LNCS665), pages 306–316, 1993.Google Scholar
  6. 6.
    J. Erickson and R. Seidel. Better lower bounds on detecting affine and spherical degeneracies. In 34th Annual IEEE Symposium on Foundations of Computer Science (FOCS’ 93), pages 528–536, 1993.Google Scholar
  7. 7.
    A. Fujiwara, M. Inoue, and M. Toshimitsu. Practical parallelizability of some P-complete problems. Technical Report of IPSF, Vol. 99, No. 72 (AL-69-2), September 1999.Google Scholar
  8. 8.
    A. Gajentaan and M. H. Overmars. On a class of O(n 2) problems in computational geometry. Computational geometry, 5:165–185, 1995.zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    R. Greenlaw, H.J. Hoover, and W.L. Ruzzo. Limits to Parallel Computation: P-Completeness Theory. Oxford university press, 1995.Google Scholar
  10. 10.
    C. Kruskal. Searching, merging and sorting in parallel computation. IEEE Transactions. on Computers, C-32(10):942–946, 1983.CrossRefMathSciNetGoogle Scholar
  11. 11.
    S. Miyano. The lexicographically first maximal subgraph problems: P-completeness and NC algorithms. Mathematical Systems Theory, 22:47–73, 1989.zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    J.S. Vitter and R.A. Simons. New classes for parallel complexity: A study of unification and other complete problems for P. IEEE Transactions of Computers, C-35(5):403–418, 1986.CrossRefGoogle Scholar
  13. 13.
    A. C. Yao. A lower bound to finding convex hulls. Journal of the ACM, 28(4):780–787, 1981.zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Akihiro Fujiwara
    • 1
  • Michiko Inoue
    • 2
  • Toshimitsu Masuzawa
    • 2
  1. 1.Kyushu Institute of TechnologyJapan
  2. 2.Nara Institute of Science and TechnologyJapan

Personalised recommendations