par Cabello, Sergio;Cardinal, Jean ;Langerman, Stefan
Référence Lecture notes in computer science, 7501 LNCS, page (241-252)
Publication Publié, 2012
Article révisé par les pairs
Résumé : Ray intersection graphs are intersection graphs of rays, or halflines, in the plane. We show that any planar graph has an even subdivision whose complement is a ray intersection graph. The construction can be done in polynomial time and implies that finding a maximum clique in a segment intersection graph is NP-hard. This solves a 21-year old open problem posed by Kratochvíl and Nešetřil. © 2012 Springer-Verlag.