A new simple algorithm for the maximum-weight independent set problem on circle graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2906, Issue , 2003, Pages 129-137

  Valiente, Gabriel ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

CHORD LENGTHS; CHORD MODELS; CIRCLE GRAPHS; INDEPENDENT SET; INTERVAL MODELS; MAXIMUM WEIGHT INDEPENDENT SET PROBLEMS; SIMPLE ALGORITHM; SPACE BOUNDS;

ALGORITHMS;

EID: 35248826481     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24587-2_15     Document Type: Article

References (21)

1. A. Apostolico, M. J. Atallah, and S. E. Hambrusch. New clique and independent set algorithms for circle graphs. Discrete Applied Mathematics, 36(1):1-24, 1992.
2. T. Asano, T. Asano, and H. Imai. Partitioning a polygonal region into trapezoids. Journal of the ACM, 33(2):290-312, 1986.
3. T. Asano, H. Imai, and A. Mukaiyama. Finding a maximum weight independent set of a circle graph. IEICE Transactions, E74(4):681-683, 1991.
4. A. Bouchet. Reducing prime graphs and recognizing circle graphs. Combinatorica, 7(3):243-254, 1987.
5. J. Cong and C. L. Liu. Over-the-cell channel routing. IEEE Transactions on Computer-Aided Design, 9(4):408-418, 1990.
6. C. P. Gabor, K. J. Supowit, and W.-L. Hsu. Recognizing circle graphs in polynomial time. Journal of the ACM, 36(3):435-473, 1989.
7. F. Gavril. Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks, 3(3):261-273, 1973.
8. O. Goldschmidt and A. Takvorian. An efficient algorithm for finding a maximum weight independent set of a circle graph. IEICE Transactions, E77-A(10):1672-1674, 1994.
9. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
10. H. Kim. An application algorithm for the via minimization problem in channel routing. In Proc. 1990 Symp. on Applied Computing, pages 150-154. IEEE, 1990.
11. H. Kim. Finding a maximum independent set in a permutation graph. Information Processing Letters, 36(1):19-23, 1990.
12. D. T. Lee and M. Sarrafzadeh. Maximum independent set of a permutation graph in k tracks. International Journal of Computational Geometry and Applications, 3(3):291-304, 1993.
13. R. Liu and S. C. Ntafos. On decomposing polygons into uniformly monotone parts. Information Processing Letters, 27(2):85-88, 1988.
14. E. Mäkinen. On the longest subsequence problem for permutations. International Journal of Computer Mathematics, 77(1):45-53, 2001.
15. F. Malucelli, T. Ottmann, and D. Pretolani. Efficient labelling algorithms for the maximum noncrossing matching problem. Discrete Applied Mathematics, 47(2):175-179, 1993.
16. W. Naji. Reconnaissance des graphes de cordes. Discrete Mathematics, 54(3):329-337, 1985.
17. R. C. Read, D. Rotem, and J. Urrutia. Orientations of circle graphs. Journal of Graph Theory, 6(3):325-341, 1982.
18. J. Spinrad. Recognition of circle graphs. Journal of Algorithms, 16(2):264-282, 1994.
19. K. J. Supowit. Finding a maximum planar subset of a set of nets in a channel. IEEE Transactions on Computer-Aided Design, 6(1):93-94, 1987.
20. P. Widmayer and C. K. Wong. An optimal algorithm for the maximum alignment of terminals. Information Processing Letters, 20(2):75-82, 1985.
21. M.-S. Yu, L. Y. Tseng, and S.-J. Chang. Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs. Information Processing Letters, 46(1):7-11, 1993.