Maximum clique in disk-like intersection graphs

DOI10.4230/LIPICS.FSTTCS.2020.17MaRDI QIDQ6839891zbMATH OpenFDO

Authors Édouard Bonnet, Nicolas Grelier, Tillmann Miltzow

Publication date 23 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2020.17

zbMATH Keywords

algorithmsAPX-hardnessdisk graphsintersection graphsmaximum cliqueNP-hardness

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cited in

(2)

• The maximum clique problem in a disk graph made easy
• Computing maximum cliques in unit disk graphs

This page was built for publication: Maximum clique in disk-like intersection graphs

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