Robert E. Tarjan

Robert E. Tarjan is a person.

• See: Minimal Biclique Set Cover Task.

---

---

References

• https://www.cs.princeton.edu/~ret/
• http://wikipedia.org/wiki/Robert_Tarjan

1988

• (Goldberg & Tarjan, 1988) ⇒ Andrew V. Goldberg, and Robert E. Tarjan . (1988). “A New Approach to the Maximum-flow Problem.” In: Journal of the ACM (JACM) 35, no. 4

1987

• (Paige & Tarjan, 1987) ⇒ Robert Paige, and Robert E. Tarjan. (1987). “Three Partition Refinement Algorithms." SIAM Journal on Computing 16, no. 6

1985

• (Sleator & Tarjan, 1985) ⇒ Daniel D. Sleator, and Robert E. Tarjan . (1985). “Amortized Efficiency of List Update and Paging Rules." Communications of the ACM 28, no. 2

1984

• (Tarjan & Yannakakis, 1984) ⇒ Robert E. Tarjan, and Mihalis Yannakakis. (1984). “Simple Linear-time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs." SIAM Journal on computing 13, no. 3

1974

• (Hopcroft & Tarjan, 1974) ⇒ John E. Hopcroft, and Robert E. Tarjan. (1974). “Efficient Planarity Testing.” In: J. ACM 21, 4. doi:10.1145/321850.321852

---