7 citations · 7 across the 2 of their papers we have counts for
3 papers · 1 filter
Heaps Simplified
Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
The heap is a basic data structure used in a wide variety of applications, including shortest path and minimum spanning tree algorithms. In this paper we explore the design space o…
Incremental Topological Ordering and Strong Component Maintenance
Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
We present an on-line algorithm for maintaining a topological order of a directed acyclic graph as arcs are added, and detecting a cycle when one is created. Our algorithm takes O(…
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…