activity
20112021
most citedOptimal Cuts and Bisections on the Real Line in Polynomial Time

1 citations · 3 across the 4 of their papers we have counts for

collaborators
Showing 2021Show all

1 paper · 1 filter

cs.DS2021

An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs

Andrzej Lingas, Mia Persson, Dzmitry Sledneu

A straightforward dynamic programming method for the single-source shortest paths problem (SSSP) in an edge-weighted directed acyclic graph (DAG) processes the vertices in a topolo…