Sparsifying Disk Intersection Graphs for Reliable Connectivity
The intersection graph induced by a set of n disks can be dense. It is thus natural to try and sparsify it, while preserving connectivity. Unfortunately, sparse graphs can always be made disconnected by removing a small number of vertices. In this work, we present a randomized sparsification algori...
Guardat en:
| Autors principals: | , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Wolfgang Mulzer
2024-12-01
|
| Col·lecció: | Computing in Geometry and Topology |
| Accés en línia: | https://www.cgt-journal.org/index.php/cgt/article/view/66 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|