Computer Science – Computational Geometry
Scientific paper
2011-11-25
Computer Science
Computational Geometry
12 pages, 7 figures
Scientific paper
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\'il and Ne\v{s}et\v{r}il.
Cabello Sergio
Cardinal Jean
Langerman Stefan
No associations
LandOfFree
The Clique Problem in Ray Intersection Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Clique Problem in Ray Intersection Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Clique Problem in Ray Intersection Graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-174355