Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Physical Sciences and Mathematics
An Efficient Algorithm To Test Potential Bipartiteness Of Graphical Degree Sequences, Kai Wang
An Efficient Algorithm To Test Potential Bipartiteness Of Graphical Degree Sequences, Kai Wang
Theory and Applications of Graphs
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.