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

被引：3
|
作者：
Saha A. [1 ]
Pal M. [1 ]
Pal T.K. [1 ]
机构：
[1] Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore - 721 102, West Bengal
来源：
Journal of Applied Mathematics and Computing | 2005年 / 19卷 / 1-2期
关键词：
Design and analysis of algorithms; Independent set; Parallel algorithms; Permutation graph;
D O I：
10.1007/BF02935789
中图分类号：
学科分类号：
摘要：
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(log2 n) time and O(n3/log n) processors on a CREW PRAM. © 2005 Korean Society for Computational & Applied Mathematics and Korean SIGCAM.
引用
收藏
页码：77 / 92
页数：15
相关论文
共 50 条
  • [1] SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE MAXIMUM-WEIGHT INDEPENDENT SET PROBLEM ON PERMUTATION GRAPHS
    YU, MS
    TSENG, LY
    CHANG, SJ
    INFORMATION PROCESSING LETTERS, 1993, 46 (01) : 7 - 11
  • [2] A new simple algorithm for the maximum-weight independent set problem on circle graphs
    Valiente, G
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2003, 2906 : 129 - 137
  • [3] EFFICIENT ALGORITHMS FOR THE MAXIMUM WEIGHT CLIQUE AND MAXIMUM WEIGHT INDEPENDENT SET PROBLEMS ON PERMUTATION GRAPHS
    CHANG, MS
    WANG, FH
    INFORMATION PROCESSING LETTERS, 1992, 43 (06) : 293 - 295
  • [4] Feature selection as maximum-weight independent set
    Zhao, Huinan
    Wang, Jisong
    Lu, Yinghua
    Sun, Hui
    Wang, Jianzhong
    ICIC Express Letters, Part B: Applications, 2013, 4 (04): : 1053 - 1058
  • [5] Maximum weight k-independent set problem on permutation graphs
    Saha, A
    Pal, M
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2003, 80 (12) : 1477 - 1487
  • [6] An Efficient Algorithm for Finding a Maximum Weight k-Independent Set on Trapezoid Graphs
    Mrinmoy Hota
    Madhumangal Pal
    Tapan K. Pal
    Computational Optimization and Applications, 2001, 18 : 49 - 62
  • [7] An efficient algorithm for finding a maximum weight k-independent set on trapezoid graphs
    Hota, M
    Pal, M
    Pal, TK
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2001, 18 (01) : 49 - 62
  • [8] An algorithm for the maximum weight independent set problem on outerstring graphs
    Keil, J. Mark
    Mitchell, Joseph S. B.
    Pradhan, Dinabandhu
    Vatshelle, Martin
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2017, 60 : 19 - 25
  • [9] Feature Tracking Utilizing a Maximum-Weight Independent Set Problem
    Schnorr, Andrea
    Helmrich, Dirk N.
    Childs, Hank
    Kuhlen, Torsten W.
    Hentschel, Bernd
    2019 IEEE 9TH SYMPOSIUM ON LARGE DATA ANALYSIS AND VISUALIZATION (LDAV), 2019, : 6 - 15
  • [10] THE WEIGHTED MAXIMUM INDEPENDENT SET PROBLEM IN PERMUTATION GRAPHS
    YU, CW
    CHEN, GH
    BIT NUMERICAL MATHEMATICS, 1992, 32 (04) : 609 - 618
12345