Optimal Data Structures for Farthest-Point Queries in Cactus Networks
Data Structures and Algorithms
2015-03-17 v1 Computational Complexity
Abstract
Consider the continuum of points on the edges of a network, i.e., a connected, undirected graph with positive edge weights. We measure the distance between these points in terms of the weighted shortest path distance, called the network distance. Within this metric space, we study farthest points and farthest distances. We introduce optimal data structures supporting queries for the farthest distance and the farthest points on trees, cycles, uni-cyclic networks, and cactus networks.
Cite
@article{arxiv.1411.1879,
title = {Optimal Data Structures for Farthest-Point Queries in Cactus Networks},
author = {Prosenjit Bose and Jean-Lou De Carufel and Carsten Grimm and Anil Maheshwari and Michiel Smid},
journal= {arXiv preprint arXiv:1411.1879},
year = {2015}
}