A linear-time algorithm for the weighted feedback vertex problem on interval graphs

Information Processing Letters

Volumn 61, Issue 2, 1997, Pages 107-111

  Lu, Chin Lung ^a   Tang, Chuan Yi ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

2 colorable subgraph problem; 2 independent set problem; Algorithms; C3,1 problem; Feedback vertex problem; Interval graphs

Indexed keywords

EID: 0000402987     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(96)00193-7     Document Type: Article

References (17)

1. A. Brandstädt, On improved time bounds for permutation graph problem, in: F.W. Mayr, ed., Proc. 18th Workshop on Graph-Theoretic in Computer Science, Lecture Notes in Computer Science, Vol. 657 (Springer, Berlin, 1993) 1-10.
2. A. Brandstädt and D. Kratsch, On domination problems for permutation and other graphs, Theoret. Comput. Sci. 54 (1987) 181-198.
3. M.S. Chang, Y.H. Chen, C.J. Chang and J.H. Yan, Algorithmic aspects of the generalized clique-transversal problem on chordal graphs, Discrete Appl. Math. 66 (3) (1996) 189-203.
4. i,-covers I: Complexity and polytopes, Discrete Math. 58 (1986) 121-142.
5. D.G. Corneil and J. Fonlupt, The complexity of generalized clique covering, Discrete Appl. Math. 22 (1988/89) 109-118.
6. F. Gavril, Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph, SIAM J. Comput. 1 (1972) 180-187.
7. M.R. Garey and D.S. Johnson, Computer and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).
8. F. Gavril, Algorithms for maximum k-colorings and k-coverings of transitive graphs, Networks 17 (1987) 465-470.
9. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980).
10. J.Y. Hsiao, C.Y. Tang and R.S. Chang, An efficient algorithm for finding a maximum weight 2-independent set on interval graphs, Inform. Process. Lett. 43 (1992) 229-235.
11. N. Korte and R.H. Möhring, An incremental linear-time algorithm for recognizing interval graphs, SIAM J. Comput. 18 (1989) 68-81.
12. Y.D. Liang, On the feedback vertex set problem in permutation graphs, Inform. Process. Lett. 52 (1994) 123-129.
13. M.V. Marathe, R. Ravi and C.P. Rangan, Generalized vertex covering in interval graphs, Discrete Appl. Math. 39 (1992) 87-93.
14. M. Sarrafzadeh and D.T. Lee, A new approach to topological via minimization, IEEE Trans. Comput. Aided Design 8 (1989) 890-900.
15. M. Sarrafzadeh and R.D. Lou, Maximum k-covering of weighted transitive graphs with applications, Algorithmica 9 (1993) 84-100.
16. M. Yannakakis, Node-deletion problem on bipartite graphs, SIAM J. Comput. 10 (1981) 310-327.
17. M. Yannakakis and F. Gavril, The maximum k-colorable subgraph problem for chordal graphs, Inform. Process. Lett. 24 (1987) 133-137.