IMPROVED ALGORITHMS FOR BIPARTITE NETWORK FLOW* (2008)
Abstract. In this paper, network flow algorithms for bipartite networks are studied. A network G = (V. E) is called bipartite if its vertex set V can be partitioned into two subsets V1 and V2 such...
IMPROVED TIME BOUNDS FOR THE MAXIMUM FLOW PROBLEM* (2008)
Ravindra K. Ahujatit, James B. Orlint, E. Tarjan
Abstract. Recently, Goldberg proposed a new approach to the maximum network flow problem. The approach yields a very simple algorithm running in O(n 3) time on n-vertex networks. Incorporation of the...
Haim Kaplan, Ron Shamir, E. Tarjan
Abstract. We study the parameterizedcomplexity of three NP-hard graph completionproblems. The MINIMUM FILL-IN problem is to decide if a graph can be triangulated by adding at most k edges. We develop...
Haim Kaplan, Ron Shamir, E. Tarjan
Abstract. We give a quadratic-time algorithm for nding the minimum number of reversals needed to sort a signed permutation. Our algorithm is faster than the previous algorithm of Hannenhalli and...
Simple confluently persistent catenable lists (1998)
Haim Kaplan, Chris Okasaki, E. Tarjan
Abstract. We consider the problem of maintaining persistent lists subject to concatenation and to insertions and deletions at both ends. Updates to a persistent data structure are nondestructive {...
Water and salt intake of wild rabbits (Oryctolagus cuniculus (L)) following dipsogenic stimuli.
Denton, D A, Nelson, J F, Tarjan, E
Wild rabbits trapped in their natural habitat and adapted to laboratory conditions were studied. Food, water and electrolyte (0.5 M-NaCl, 0.5 M-KCl, 0.25 M-MgCl2 and 0.25 M-CaCl2) consumption,...
Water and salt intake of wild rabbits (Oryctolagus cuniculus (L)) following dipsogenic stimuli.
Denton, D A, Nelson, J F, Tarjan, E
Wild rabbits trapped in their natural habitat and adapted to laboratory conditions were studied. Food, water and electrolyte (0.5 M-NaCl, 0.5 M-KCl, 0.25 M-MgCl2 and 0.25 M-CaCl2) consumption,...