Optimal Data Structures for Farthest-Point Queries in Cactus Networks

DOI10.7155/jgaa.00345zbMath1306.05229arXiv1411.1879OpenAlexW2117581040MaRDI QIDQ2940594

Prosenjit Bose, Anil Maheshwari, Jean-Lou De Carufel, Carsten Grimm, Michiel H. M. Smid

Publication date: 27 January 2015

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.1879

zbMATH Keywords

network distanceoptimal data structures

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Data structures (68P05)

Related Items

Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks

Uses Software

• Algorithm 447
• SANET