| Naslov: | Algorithms for distance problems in continuous graphs |
|---|
| Avtorji: | ID Cabello, Sergio (Avtor) ID Garijo, Delia (Avtor) ID Kalb, Antonia (Avtor) ID Klute, Fabian (Avtor) ID Parada, Irene (Avtor) ID Silveira, Rodrigo I. (Avtor) |
| Datoteke: | PDF - Predstavitvena datoteka, prenos (946,64 KB) MD5: 1579CD8B964FC7804ED311E0CB11A34C
URL - Izvorni URL, za dostop obiščite https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.13
|
|---|
| Jezik: | Angleški jezik |
|---|
| Tipologija: | 1.08 - Objavljeni znanstveni prispevek na konferenci |
|---|
| Organizacija: | IMFM - Inštitut za matematiko, fiziko in mehaniko
|
|---|
| Povzetek: | We study the problem of computing the diameter and the mean distance of a continuous graph, i.e., a connected graph where all points along the edges, instead of only the vertices, must be taken into account. It is known that for continuous graphs with $m$ edges these values can be computed in roughly $O(m^2)$ time. In this paper, we use geometric techniques to obtain subquadratic time algorithms to compute the diameter and the mean distance of a continuous graph for two well-established classes of sparse graphs. We show that the diameter and the mean distance of a continuous graph of treewidth at most $k$ can be computed in $O(n \log^{O(k)} n)$ time, where $n$ is the number of vertices in the graph. We also show that computing the diameter and mean distance of a continuous planar graph with $n$ vertices and $F$ faces takes $O(n F \log n)$ time. |
|---|
| Ključne besede: | diameter, mean distance, continuous graphs, treewidth, planar graphs |
|---|
| Status publikacije: | Objavljeno |
|---|
| Verzija publikacije: | Objavljena publikacija |
|---|
| Leto izida: | 2025 |
|---|
| Št. strani: | Str. 13:1-13:16 |
|---|
| PID: | 20.500.12556/DiRROS-24740  |
|---|
| UDK: | 004.42:519.17 |
|---|
| DOI: | 10.4230/LIPIcs.WADS.2025.13  |
|---|
| COBISS.SI-ID: | 261662723  |
|---|
| Datum objave v DiRROS: | 16.12.2025 |
|---|
| Število ogledov: | 10 |
|---|
| Število prenosov: | 7 |
|---|
| Metapodatki: |  |
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |