Computer Algorithms II Lecture Notes

20 November 2008 • Traveling, Flowing, and Matching

A set S is partitioned into two subsets S₁ and S₂ when

• S = S₁ ∪ S₂.

• ∅ = S₁ ∩ S₂.

that is,

• Every element in S is an element of either S₁ or S₂.

• S₁ and S₂ have no common elements.

This page last modified on 24 January 2006.