13 citations · 39 across the 12 of their papers we have counts for
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 and possible weights typically consisting of positive and negative…
cs.DS2024
Insights into -shortcutting algorithms
Alexander Leonhardt, Ulrich Meyer, Manuel Penschuck
A graph is called a -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…