The Clique Problem in Ray Intersection Graphs

DOI10.1007/978-3-642-33090-2_22zbMath1365.05217arXiv1111.5986OpenAlexW1822087134MaRDI QIDQ2912845

Jean Cardinal, Sergio Cabello, Stefan Langerman

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.5986

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

The maximum clique problem in multiple interval graphs