Robust Algorithms for Finding Triangles and Computing the Girth in Unit Disk and Transmission Graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914781106012160 |
|---|---|
| author | Klost, Katharina Mulzer, Wolfgang |
| author_facet | Klost, Katharina Mulzer, Wolfgang |
| contents | We describe optimal robust algorithms for finding a triangle and the unweighted girth in a unit disk graph, as well as finding a triangle in a transmission graph.In the robust setting, the input is not given as a set of sites in the plane, but rather as an abstract graph. The input may or may not be realizable as a unit disk graph or a transmission graph. If the graph is realizable, the algorithm is guaranteed to give the correct answer. If not, the algorithm will either give a correct answer or correctly state that the input is not of the required type. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_01180 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Robust Algorithms for Finding Triangles and Computing the Girth in Unit Disk and Transmission Graphs Klost, Katharina Mulzer, Wolfgang Computational Geometry We describe optimal robust algorithms for finding a triangle and the unweighted girth in a unit disk graph, as well as finding a triangle in a transmission graph.In the robust setting, the input is not given as a set of sites in the plane, but rather as an abstract graph. The input may or may not be realizable as a unit disk graph or a transmission graph. If the graph is realizable, the algorithm is guaranteed to give the correct answer. If not, the algorithm will either give a correct answer or correctly state that the input is not of the required type. |
| title | Robust Algorithms for Finding Triangles and Computing the Girth in Unit Disk and Transmission Graphs |
| topic | Computational Geometry |
| url | https://arxiv.org/abs/2405.01180 |