Alexander Leonhardt

activity

20242026

collaborators

Showing 2024Show all

2 papers · 1 filter

cs.DS2024

Efficient Uniform Negative Edge Weights

Lukas Geis, Daniel Allendorf, Thomas Bläsius +4

We consider a maximum entropy edge weight model that allows for negative weights. Given a graph $G$ and possible weights $W$ typically consisting of positive and negative…

cs.DS2024

Insights into $(k, ρ)$ -shortcutting algorithms

Alexander Leonhardt, Ulrich Meyer, Manuel Penschuck

A graph is called a $(k, ρ)$ -graph iff every node can reach $ρ$ of its nearest neighbors in at most k hops. This property proved useful in the analysis and design of parallel shorte…

Efficient Uniform Negative Edge Weights

Insights into (k,ρ)-shortcutting algorithms

Insights into $(k, ρ)$ -shortcutting algorithms