Abstract
A string-graph is an intersection graph of a set of curves in the plane. Investigating the complexity of the max clique problem for some classes of string-graphs we obtain NP- completeness results on one hand and polynomial time algorithms on the other hand for string-graph-classes of at first sight surprising similarity.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
