Cargando…
Computing a maximum clique in geometric superclasses of disk graphs
In the 90’s Clark, Colbourn and Johnson wrote a seminal paper where they proved that maximum clique can be solved in polynomial time in unit disk graphs. Since then, the complexity of maximum clique in intersection graphs of d-dimensional (unit) balls has been investigated. For ball graphs, the prob...
| Autor principal: | |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9568498/ https://www.ncbi.nlm.nih.gov/pubmed/36258784 http://dx.doi.org/10.1007/s10878-022-00853-2 |