3 papers
math.CO2026
Diameter and Length of Metric Graphs
Hee-Kap Ahn, Sergio Cabello, Otfried Cheong +2
A metric graph is a metric space obtained from a finite collection of intervals whose endpoints are identified in groups. It can also be seen as a finite, edge-weighted graph where…
cs.DS2026
Testing whether a subgraph is convex or isometric
Sergio Cabello
We consider the following two algorithmic problems: given a graph and a subgraph , decide whether is an isometric or a geodesically convex subgraph of . It…
cs.CG2025
Algorithms for Distance Problems in Continuous Graphs
Sergio Cabello, Delia Garijo, Antonia Kalb +3
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,…