On the clique problem in intersection graphs of ellipses

DOI10.1007/3-540-36136-7_43MaRDI QIDQ4427870zbMATH OpenFDO

Authors Christoph Ambühl, Uli Wagner

Publication date 14 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2518/25180489.htm

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• The clique problem in intersection graphs of ellipses and triangles
• QPTAS and subexponential algorithm for maximum clique on disk graphs
• scientific article; zbMATH DE number 4200260
• The Clique Problem in Ray Intersection Graphs
• The clique problem in ray intersection graphs

Cited in

(2)

• The clique problem in intersection graphs of ellipses and triangles
• The Clique Problem in Ray Intersection Graphs

Describes a project that uses

Uses Software

• CALMA

This page was built for publication: On the clique problem in intersection graphs of ellipses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427870)