Tarjan Robert E.

Robert E. Tarjan

Information about the author Robert E. Tarjan will soon be added to the site.
Found 8 papers in total
Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
1997
The dynamic tree> is an abstract data type that allows the maintenance of a...
Faster algorithms for the shortest path problem
Faster algorithms for the shortest path problem
1990
Efficient implementations of Dijkstra's shortest path algorithm are investigated. A...
Finding minimum-cost flows by double scaling
Finding minimum-cost flows by double scaling
1992
Several researchers have recently developed new techniques that give fast algorithms...
Fibonacci heaps and their uses in improved network optimization algorithms
Fibonacci heaps and their uses in improved network optimization algorithms
1987
In this paper the authors develop a new data structure for implementing heaps...
Efficiency of the primal network simplex algorithm for the minimum-cost circulation problem
Efficiency of the primal network simplex algorithm for the minimum-cost circulation problem
1991
The paper studies the number of pivots required by the primal network simplex...
Finding minimum-cost circulations by successive approximation
Finding minimum-cost circulations by successive approximation
1990
The authors develop a new approach to solving minimum-cost circulation problems. The...
A parallel algorithm for finding a blocking flow in an acyclic network
A parallel algorithm for finding a blocking flow in an acyclic network
1989
The authors propose a simple parallel algorithm for finding a blocking flow in an...
As fast parametric maximum flow algorithm and applications
As fast parametric maximum flow algorithm and applications
1989
The classical maximum flow problem sometimes occurs in settings in which the arc...
Papers per page: