greedy=[(0, 0)]; maximum=[(0, 1), (1, 0)]
graphs_compared=689; assignment_vectors=35799; greedy_shortfalls=104
PASS; exhaustive scope: labeled bipartite partitions 0..3 each
