A sequential algorithm for finding a maximum weight K-independent set on interval graphs

International Journal of Computer Mathematics

Volumn 60, Issue 3-4, 1996, Pages 205-214

  Pal, Madhumangal ^a   Bhattacharjee, G P ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

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

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY;

INDEPENDENT SET; INTERVAL GRAPH; MAXIMUM WEIGHT; NETWORK FLOW PROBLEM; SEQUENTIAL ALGORITHM; TIME COMPLEXITY;

ALGORITHMS;

EID: 0029712085     PISSN: 00207160     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207169608804486     Document Type: Article

References (14)

1. R. K. Ahuja, K. Mehlhorn, J. B. Orlin and R. E. Tarjan, Faster algorithms for the shortest path problem, JACM, 37 (1990) 213-223.
2. J. Edmonds and R. M. Karp, Theoretical improvements in algorithmic efficiency for network flow problems, JACM 19 (1972) 248-264.
3. D. R. Fulkerson and O. A. Gross, Incidence matrices and intervals graphs, Pacific J- Math. 15 (1965) 835-855.
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. P. C. Gilmore and A. J. Hoffman, A characterization of Comparability graphs and of interval graphs, Canad. J. Math., 16 (1964) 539-548.
6. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York 1980).
7. 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, Information Processing Letters, 40 (1991) 283-287.
8. J. Y Hsiao, C. Y. Tang and R. S. Chang, An efficient algorithm for finding a maximum weight 2-independent set on interval graphs, Information Processing Letters, 43 (1992) 229-235.
9. W. L. Hsu and K. H. Tsai, A linear time algorithm for the two-track assignment problem. Proceedings of 27th Allerton Conf. on Communication, Control and Computing (1989) 291-300.
10. D. S. Johnson, The NP-Completeness Column: An on going guide, J. Algorithms 6 (1985) 434-451.
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. F. S. Roberts, Graph Theory and its Application to Problems of Society (SIAM, Philadelphia, PA, 1978).
13. M. Sarrafgadeh and D. T. Lee, A new approach to topological via minimization, IEEE Trans. Computer Aided Design, 8 (1989) 890-900.
14. M. Yannakakis and F. Gavril, The maximum k-colorable subgraph problem for chordal graphs, Information Processing Letters, 24 (1987) 133-137.