A polynomial-time customizable algorithm with empirically low error rates is proposed for testing potential bipartiteness of degree sequences, but without a proof of completeness.
Recherches analytiques la th´ eorie des nom bres premiers
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences
A polynomial-time customizable algorithm with empirically low error rates is proposed for testing potential bipartiteness of degree sequences, but without a proof of completeness.