The clique problem in intersection graphs of ellipses and triangles

DOI10.1007/s00224-005-1141-6zbMath1101.68714OpenAlexW1981991091MaRDI QIDQ1780844

Uli Wagner, Christoph Ambühl

Publication date: 14 June 2005

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: http://doc.rero.ch/record/318502/files/224_2005_Article_1141.pdf

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (6)

Improved bounds on the Hadwiger-Debrunner numbers ⋮ Homothetic polygons and beyond: maximal cliques in intersection graphs ⋮ The clique problem in ray intersection graphs ⋮ Co-bipartite neighborhood edge elimination orderings ⋮ Stabbing pairwise intersecting disks by five points ⋮ Unnamed Item

Uses Software

• CALMA

This page was built for publication: The clique problem in intersection graphs of ellipses and triangles