A linear-time algorithm for a special case of disjoint set union

Fast Algorithms for Finding Nearest Common Ancestors

Dov Harel, Robert E. Tarjan · SIAM Journal on Computing · 1984 · 1.1K citations

Computing, Computer Science, Algorithms +7

An O(v|v| c |E|) algoithm for finding maximum matching in general graphs

Silvio Micali, Vijay V. Vazirani · 1980 · 829 citations

Computing, Computer Science, Algorithms +14

A fast algorithm for finding dominators in a flowgraph

Thomas Lengauer, Robert E. Tarjan · ACM Transactions on Programming Languages and Systems · 1979 · 632 citations

Computing, Computer Science, Algorithms +12

Worst-case Analysis of Set Union Algorithms

Robert E. Tarjan, Jan Van Leeuwen · Journal of the ACM · 1984 · 458 citations · Full text

Computing, Computer Science, Computer Systems +6

An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs

Harold N. Gabow · Journal of the ACM · 1976 · 340 citations · Full text

Computing, Computer Science, Mathematics +10