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

DOI10.1007/978-3-662-53174-7_10zbMath1417.68035arXiv1503.01706OpenAlexW1551968485MaRDI QIDQ2827807

Carsten Grimm

Publication date: 21 October 2016

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Database theory (68P15) Network design and communication in computer systems (68M10) Data structures (68P05)

Related Items (1)

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

Cites Work

• Unnamed Item
• The continuous center set of a network
• Fractional cascading. I: A data structuring technique
• Combinatorial algorithms on a class of graphs
• Efficient algorithms for center problems in cactus networks
• Topology of series-parallel networks
• Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks
• Optimal Data Structures for Farthest-Point Queries in Cactus Networks
• Network farthest-point diagrams
• Easy problems for tree-decomposable graphs
• Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
• Linear-time computability of combinatorial problems on series-parallel graphs
• The Voronoi Partition of a Network and Its Implications in Location Theory
• Graph Classes: A Survey
• Linear-time computation of optimal subgraphs of decomposable graphs

This page was built for publication: Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks