  As a partial answer to a question of Rao, a deterministic and customizable
efficient algorithm is presented to test whether an arbitrary graphical degree
sequence has a bipartite realization. The algorithm can be configured to run in
polynomial time, at the expense of possibly producing an erroneous output on
some "yes" instances but with very low error rate.
