| Title: | Algorithms for distance problems in continuous graphs |
|---|
| Authors: | ID Cabello, Sergio (Author) ID Garijo, Delia (Author) ID Kalb, Antonia (Author) ID Klute, Fabian (Author) ID Parada, Irene (Author) ID Silveira, Rodrigo I. (Author) |
| Files: | PDF - Presentation file, download (946,64 KB) MD5: 1579CD8B964FC7804ED311E0CB11A34C
URL - Source URL, visit https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.13
|
|---|
| Language: | English |
|---|
| Typology: | 1.08 - Published Scientific Conference Contribution |
|---|
| Organization: | IMFM - Institute of Mathematics, Physics, and Mechanics
|
|---|
| Abstract: | 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. |
|---|
| Keywords: | diameter, mean distance, continuous graphs, treewidth, planar graphs |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Year of publishing: | 2025 |
|---|
| Number of pages: | Str. 13:1-13:16 |
|---|
| PID: | 20.500.12556/DiRROS-24740  |
|---|
| UDC: | 004.42:519.17 |
|---|
| DOI: | 10.4230/LIPIcs.WADS.2025.13  |
|---|
| COBISS.SI-ID: | 261662723  |
|---|
| Publication date in DiRROS: | 16.12.2025 |
|---|
| Views: | 7 |
|---|
| Downloads: | 6 |
|---|
| Metadata: |  |
|---|
|
:
|
Copy citation |
|---|
| | | | Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |