Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

AN EFFICIENT PRAM ALGORITHM FOR MAXIMUM-WEIGHT INDEPENDENT SET ON PERMUTATION GRAPHS

  • SAHA ANITA (Vidyasagar University) ;
  • PAL MADHUMANGAL (Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University) ;
  • PAL TAPAN K. (Vidyasagar University)
  • Published : 2005.09.01

⟨ Previous Next ⟩

Abstract

An efficient parallel algorithm is presented to find a maximum weight independent set of a permutation graph which takes O(log n) time using O($n^2$/ log n) processors on an EREW PRAM, provided the graph has at most O(n) maximal independent sets. The best known parallel algorithm takes O($log^2n$) time and O($n^3/log\;n$) processors on a CREW PRAM.

Keywords