research
∙
07/10/2022
Closing the Gap Between Directed Hopsets and Shortcut Sets
For an n-vertex directed graph G = (V,E), a β-shortcut set H is a set of...
share
research
∙
03/05/2022
Online List Labeling: Breaking the log^2n Barrier
The online list labeling problem is an algorithmic primitive with a larg...
research
∙
01/29/2020
