Maximum weight k-independent set problem on permutation graphs

International Journal of Computer Mathematics

Volumn 80, Issue 12, 2003, Pages 1477-1487

  Saha, Anita ^a   Pal, Madhumangal ^a  

^a VIDYASAGAR UNIVERSITY   (India)

Author keywords

Analysis of algorithms; Combinatorial problems; Design of algorithms; Independent set; Network flow problem; Permutation graph

Indexed keywords

ALGORITHMS; COMPUTER AIDED DESIGN; JOB ANALYSIS; PROBLEM SOLVING; SCHEDULING; SET THEORY; VLSI CIRCUITS;

ANALYSIS OF ALGORITHMS; DESIGN OF ALGORITHMS; INDEPENDENT SET; NETWORK FLOW PROBLEMS; PERMUTATION GRAPHS;

GRAPH THEORY;

EID: 28344439796     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160310001614972     Document Type: Article

References (17)

1. R. K. Ahuja, K. Mehlhorn, J. B. Orlin, and R. E. Tarjan, Faster algorithms for the shortest path problem, J. ACM, 37 (1990) 213-223.
2. M. S. Chang and F.-H. Wang, Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs, Inf. Process. Lett., 43 (1992) 293-295.
3. J. Edmonds and R. M. Karp, Theoretical improvements in algorithmic efficiency for network flow problems, J. ACM, 19 (1972) 248-264.
4. M. R. Garey and D. S. Johnson, Computer and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA (1979).
5. M. C. Golumbic, Algorithmic Graph Theory and Peifect Graphs, Academic Press, New York (1980).
6. J. Y. Hsiao, C. Y. Tang, and R. S. Chang, Solving the single step graph searching problem by solving the maximum two-independent set problem, Inf. Process. Lett., 40 (1991) 283-287.
7. J. Y. Hsiao, C. Y. Tang, and R. S. Chang, An efficient algorithm for finding a maximum weight 2-independent set on interval graphs, Inf. Process. Lett., 43 (1992) 229-235.
8. W. L. Hsu and K. H. Tsai, A linear time algorithm for the two-track assignment problem, Proceedings of 27th Allerton Conf. on Communication, Contwl and Computing, (1989) pp. 291-300.
9. D. S. Johnson, The NP-Completeness Column: An on going guide, J. Algorithms, 6 (1985) 434-451.
10. H. Kim, Finding a maximum independent set in a permutation graph, Inf. Process. Lett., 36 (1990) 19-23.
11. R. D. Lou, M. Sarrafgadeh, and D. T. Lee, An optimal algorithm for the maximum two-chain problem, SIAM J. Discrete Math., 5 (1992) 285-304.
12. M. Pal and G. P. Bhattacharjee, A sequential algorithm for finding a maximum weight k-independent set on interval graphs, Intern. J. Comput. Math., 60 (1996) 205-214.
13. A. Pnueli, S. Even, and A. Lempel, Transitive orientation of graphs and identification of permutation graphs, Can. J. Math., 23 (1971) 160-175.
14. M. Sarrafgadeh and D. T. Lee, A new approach to topological via minimization, IEEE Trans. Computer Aided Design, 8 (1989) 890-900.
15. M. Yannakakis and F. Gavril, The maximum k-colorable subgraph problem for chordal graphs, Inf. Process. Lett., 24 (1987) 133-137.
16. C.-W. Yu and G.-H. Chen, The weighted maximum independent set problem in permutation graphs, BIT, 32 (1992) 609-618.
17. M. S. Yu, L. Y. Tseng and S.-J. Chang, Sequential and parallel algorithms for the maximum weight independent set problem on permutation graphs, Inf. Process. Lett., 46 (1993) 7-11.