# Interval Query Problem on Cube-free Median Graphs

In this paper, we introduce the interval query problem on cube-free median graphs. Let G be a cube-free median graph and 𝒮 be a commutative semigroup. For each vertex v in G, we are given an element p(v) in 𝒮. For each query, we are given two vertices u,v in G and asked to calculate the sum of p(z) over all vertices z belonging to a u-v shortest path. This is a common generalization of range query problems on trees and grids. In this paper, we provide an algorithm to answer each interval query in O(log^2 n) time. The required data structure is constructed in O(nlog^3 n) time and O(nlog^2 n) space. To obtain our algorithm, we introduce a new technique, named the stairs decomposition, to decompose an interval of cube-free median graphs into simpler substructures.

## Authors

• 7 publications
09/20/2018

### L_1 Shortest Path Queries in Simple Polygons

Let P be a simple polygon of n vertices. We consider two-point L_1 short...
02/25/2019

### Succinct Data Structures for Families of Interval Graphs

We consider the problem of designing succinct data structures for interv...
04/30/2020

### An Efficient Noisy Binary Search in Graphs via Median Approximation

Consider a generalization of the classical binary search problem in line...
10/18/2021

### Planar Median Graphs and Cubesquare-Graphs

Median graphs are connected graphs in which for all three vertices there...
11/14/2021

### A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs

Given an n-vertex planar embedded digraph G with non-negative edge weigh...
05/30/2019

### Compact Data Structures for Shortest Unique Substring Queries

Given a string T of length n, a substring u = T[i.. j] of T is called a ...
06/04/2018

### Efficient Genomic Interval Queries Using Augmented Range Trees

Efficient large-scale annotation of genomic intervals is essential for p...
##### This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.