Mads Vestergaard Jensen

collaborators

3 papers

cs.DS2026

Instance-Optimality of Bidirectional Dijkstra on Simple Graphs

Christian Bertram, Mads Vestergaard Jensen, Mikkel Thorup +2

We study the shortest-path problem on graphs with positive real-valued edge weights. Given a source vertex $s$ and a target vertex $t$ , the goal is to calculate the length of the s…

cs.DS2026

Personalized PageRank Estimation in Undirected Graphs

Christian Bertram, Mads Vestergaard Jensen

Given an undirected graph $G = (V, E)$ , the Personalized PageRank (PPR) of $t \in V$ with respect to $s \in V$ , denoted $π (s, t)$ , is the probability that an $α$ -discounted random walk…

cs.DS2025

Dynamic Meta-Kernelization

Christian Bertram, Deborah Haun, Mads Vestergaard Jensen +1

Kernelization studies polynomial-time preprocessing algorithms. Over the last 20 years, the most celebrated positive results of the field have been linear kernels for classical NP-…