Abstract
The problem of finding an independent set of maximum weight for the chord model of a circle graph is solved in O(ℓ) time and O(n) space, where n is the number of vertices and ℓ is the total chord length of the circle graph. The best previous algorithm required O(dn) time and space, where d is the maximum number of intervals crossing any position on the line in the interval model of the graph. The algorithm is practical, requires only simple data structures to be implemented within the stated time and space bounds, and has small hidden constants.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Apostolico, A., Atallah, M.J., Hambrusch, S.E.: New clique and independent set algorithms for circle graphs. Discrete Applied Mathematics 36(1), 1–24 (1992)
Asano, T., Asano, T., Imai, H.: Partitioning a polygonal region into trapezoids. Journal of the ACM 33(2), 290–312 (1986)
Asano, T., Imai, H., Mukaiyama, A.: Finding a maximum weight independent set of a circle graph. IEICE Transactions E74(4), 681–683 (1991)
Bouchet, A.: Reducing prime graphs and recognizing circle graphs. Combinatorica 7(3), 243–254 (1987)
Cong, J., Liu, C.L.: Over-the-cell channel routing. IEEE Transactions on Computer-Aided Design 9(4), 408–418 (1990)
Gabor, C.P., Supowit, K.J., Hsu, W.-L.: Recognizing circle graphs in polynomial time. Journal of the ACM 36(3), 435–473 (1989)
Gavril, F.: Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks 3(3), 261–273 (1973)
Goldschmidt, O., Takvorian, A.: An efficient algorithm for finding a maximum weight independent set of a circle graph. IEICE Transactions E77-A(10), 1672–1674 (1994)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)
Kim, H.: An application algorithm for the via minimization problem in channel routing. In: Proc. 1990 Symp. on Applied Computing, pp. 150–154. IEEE, Los Alamitos (1990)
Kim, H.: Finding a maximum independent set in a permutation graph. Information Processing Letters 36(1), 19–23 (1990)
Lee, D.T., Sarrafzadeh, M.: Maximum independent set of a permutation graph in k tracks. International Journal of Computational Geometry and Applications 3(3), 291–304 (1993)
Liu, R., Ntafos, S.C.: On decomposing polygons into uniformly monotone parts. Information Processing Letters 27(2), 85–88 (1988)
Mäkinen, E.: On the longest subsequence problem for permutations. International Journal of Computer Mathematics 77(1), 45–53 (2001)
Malucelli, F., Ottmann, T., Pretolani, D.: Efficient labelling algorithms for the maximum noncrossing matching problem. Discrete Applied Mathematics 47(2), 175–179 (1993)
Naji, W.: Reconnaissance des graphes de cordes. Discrete Mathematics 54(3), 329–337 (1985)
Read, R.C., Rotem, D., Urrutia, J.: Orientations of circle graphs. Journal of Graph Theory 6(3), 325–341 (1982)
Spinrad, J.: Recognition of circle graphs. Journal of Algorithms 16(2), 264–282 (1994)
Supowit, K.J.: Finding a maximum planar subset of a set of nets in a channel. IEEE Transactions on Computer-Aided Design 6(1), 93–94 (1987)
Widmayer, P., Wong, C.K.: An optimal algorithm for the maximum alignment of terminals. Information Processing Letters 20(2), 75–82 (1985)
Yu, M.-S., Tseng, L.Y., Chang, S.-J.: Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs. Information Processing Letters 46(1), 7–11 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Valiente, G. (2003). A New Simple Algorithm for the Maximum-Weight Independent Set Problem on Circle Graphs. In: Ibaraki, T., Katoh, N., Ono, H. (eds) Algorithms and Computation. ISAAC 2003. Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24587-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-24587-2_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20695-8
Online ISBN: 978-3-540-24587-2
eBook Packages: Springer Book Archive