Skip to main content
SpringerLink
Log in

An efficient pram algorithm for maximum-weight independent set on permutation graphs

  • Published:
Journal of Applied Mathematics and Computing Aims and scope Submit manuscript

Abstract

An efficient parallel algorithm is presented to find a maximum weight independent set of a permutation graph which takesO (logn) time usingO (n 2/logn) processors on an EREW PRAM, provided the graph has at mostO (n) maximal independent sets. The best known parallel algorithm takesO (log2 n) time andO (n 3/logn) processors on a CREW PRAM.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Bera, M. Pal and T. K. Pal,An optimal parallel algorithm to compute all cut vertices and blocks on permutation graphs, Intern. J. Computer Mathematics72(4) (1999), 449–462.

    Article  MATH  MathSciNet  Google Scholar 

  2. C. C.-Y. Chen, S. K. Das and S. G. Akl,A unified approach to parallel depth-first traversals of general trees, Information Processing Letters38 (1991), 49–55.

    Article  MATH  MathSciNet  Google Scholar 

  3. M. S. Chang and F.-H. Wang,Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs, Information Processing Letters43 (1992), 293–295.

    Article  MATH  MathSciNet  Google Scholar 

  4. R. Cole and U. Vishkin,Faster optimal parallel prefix sums and list ranking, Infomation and Computing81 (1989), 334–352.

    Article  MATH  MathSciNet  Google Scholar 

  5. M. Fisher and L. Ladner,Parallel prefix computation, J. ACM27 (1980), 831–838.

    Article  Google Scholar 

  6. M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness, (Freeman, San Francisco, 1979).

    MATH  Google Scholar 

  7. M. C. Golumbic,Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980).

    MATH  Google Scholar 

  8. M. Hota, M. Pal and T. K. Pal,An efficient algorithm to generate all maximal independent sets on trapezoid graphs, Intern. J. Computer Mathematics70 (1999), 587–599.

    Article  MATH  MathSciNet  Google Scholar 

  9. M. Hota, M. Pal and T. K. Pal,An efficient algorithm for finding a maximum weight k-independent set on trapezoid graphs, Computational Optimization and Applications18 (2001), 49–62.

    Article  MATH  MathSciNet  Google Scholar 

  10. H. Kim,Finding a maximum independent set in a permutation graph, Information Processing Letters36 (1990), 19–23.

    Article  MATH  MathSciNet  Google Scholar 

  11. S. Mondal, M. Pal and T. K. Pal,An optimal algorithm for finding Depth First Spanning tree on permutation graphs, Korean J. Comput. & Appl. Math.6 (1999), 493–500.

    MATH  MathSciNet  Google Scholar 

  12. S. Mondal, M. Pal and T. K. Pal,An optimal algorithm to solve the all-pairs shortest paths problem on permutation graphs, J. Mathematical Modelling and Applications2(1) (2003), 57–65.

    MATH  MathSciNet  Google Scholar 

  13. S. Mondal, M. Pal and T. K. Pal,Optimal sequential and parallel algorithms to compute a Steiner tree on permutation graphs, Intern. J. Computer Mathematics80(8) (2003), 937–943.

    Article  MathSciNet  Google Scholar 

  14. M. Pal and G. P. Bhattacharjee,A sequential algorithm for finding a maximum weight k-independetn, set on interval graphs, Intern. J. Computer Mathematics60 (1996), 205–214.

    Article  MATH  Google Scholar 

  15. M. Pal,A parallel algorithm to generate all maximal independent sets on permutation graphs, Intern. J. Computer Mathematics67 (1998), 261–274.

    Article  MATH  Google Scholar 

  16. M. Pal,Efficient algorithms to compute all articulation points of a permutation graph, The Korean J. Computational and Applied Mathematics5(1) (1998), 141–152.

    MATH  Google Scholar 

  17. A. Saha and M. Pal,Maximum weight k-independent set problem on permutation graphs, Intern. J. Computer Mathematics80(12) (2003), 1477–1487.

    Article  MATH  MathSciNet  Google Scholar 

  18. S. Saxena, P. C. P. Bhatt and V. C. Prasad,On parallel prefix computation, Parallel Processing Letters4 (1994), 429–436.

    Article  Google Scholar 

  19. C.-W. Yu and G.-H. Chen,The weighted maximum independent set problem in permutation graphs, BIT,32 (1992), 609–618.

    Article  MATH  MathSciNet  Google Scholar 

  20. M. S. Yu, L. Y. Tseng and S.-J. Chang,Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs, Information Processing Letters46 (1993), 7–11.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, 721 102, Midnapore, West Bengal, India

    Anita Saha, Madhumangal Pal & Tapan K. Pal

Authors
  1. Anita Saha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Madhumangal Pal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tapan K. Pal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Madhumangal Pal.

Additional information

Anita Saha received her M. Sc from Vidyasagar University, India in 2000. She has started her Ph. D. work at Vidyasagar University on 2000. Her research interests include computational graph theory, parallel algorithms, data structure.

Madhumangal Pal received his M. Sc from Vidyasagar University, India and Ph. D from Indian Institute of Technology, Kharagpur, India in 1990 and 1996 respectively. He is engaged in research since 1991. In 1996, he received Computer Division Award from Institution of Engineers (India), for best research work. During 1997 to 1999 he was a faculty member of Midnapore College and since 1999 he has been at the Vidyasagar University, India. His research interest include computational graph theory, parallel algorithms, data structure, combinatorial algorithms, genetic algorithms, fuzzy sets and intuitionistic fuzzy sets.

Tapan K. Pal received his M. Sc in 1971 and Ph. D in 1982 from Indian Institute of Technology, Kharagpur, India. During 1971 to 1987 he was a faculty member of Kharagpur College and since 1987 he has been at the Vidyasagar University, India. His research interest includes Operations Research, Graph Theory and Functional Analysis.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Saha, A., Pal, M. & Pal, T.K. An efficient pram algorithm for maximum-weight independent set on permutation graphs. JAMC 19, 77–92 (2005). https://doi.org/10.1007/BF02935789

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02935789

AMS Mathematics Subject Classification

Key words and phrases

Search

Navigation