186 citations · 243 across the 28 of their papers we have counts for
Showing 2007Show all
2 papers · 1 filter
cs.DS2007
Finding a Feasible Flow in a Strongly Connected Network
Bernhard Haeupler, Robert E. Tarjan
We consider the problem of finding a feasible single-commodity flow in a strongly connected network with fixed supplies and demands, provided that the sum of supplies equals the su…
cs.DS2007
Data Structures for Mergeable Trees
Loukas Georgiadis, Haim Kaplan, Nira Shafrir +2
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant requires merging two…