Digital repository of Slovenian research organisations

Show document
A+ | A- | Help | SLO | ENG

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 PDF - Presentation file, download (946,64 KB)
MD5: 1579CD8B964FC7804ED311E0CB11A34C
 
URL 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:Logo 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 New window
UDC:004.42:519.17
DOI:10.4230/LIPIcs.WADS.2025.13 New window
COBISS.SI-ID:261662723 New window
Publication date in DiRROS:16.12.2025
Views:7
Downloads:6
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a monograph

Title:19th International Symposium on Algorithms and Data Structures : WADS 2025, August 11–15, 2025, York University, Toronto, Canada
Editors:Pat Morin, Eunjin Oh
Place of publishing:Saarbrücken/Wadern
Publisher:Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing
Year of publishing:2025
ISBN:978-3-95977-398-0
COBISS.SI-ID:261608451 New window
Collection title:Leibniz international proceedings in informatics
Collection numbering:ǂvol. ǂ349
Collection ISSN:1868-8969

Document is financed by a project

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0297
Name:Teorija grafov

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0218
Name:Prepletanje geometrije, topologije in algebre v strukturni in topološki teoriji grafov

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0285
Name:Metrični problemi v grafih in hipergrafih

Funder:EC - European Commission
Project number:101071836
Name:KARST: Predicting flow and transport in complex Karst systems
Acronym:KARST

Funder:MICIU - Spanish Ministry of Science, Innovation and Universities
Funding programme:MICIU/AEI/10.13039/501100011033
Project number:PID2019-104129GB-I00

Funder:MICIU - Spanish Ministry of Science, Innovation and Universities
Funding programme:MICIU/AEI/10.13039/501100011033
Project number:PID2023-150725NB-I00

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Back