Ruimin Zhang

collaborators

2 papers

cs.DS2023

A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest Paths

Julia Chuzhoy, Ruimin Zhang

We study the fully dynamic All-Pairs Shortest Paths (APSP) problem in undirected edge-weighted graphs. Given an $n$ -vertex graph $G$ with non-negative edge lengths, that undergoes…

math.CO2020

Finding Structure in Sequences of Real Numbers via Graph Theory: a Problem List

Dana G. Korssjoen, Biyao Li, Stefan Steinerberger +2

We investigate a method of generating a graph $G = (V, E)$ out of an ordered list of $n$ distinct real numbers $a_{1}, \dots, a_{n}$ . These graphs can be used to test for the presence of…