Doubly Lexical Ordering of Dense 0 - 1 Matrices

Abstract We present an algorithm for the doubly lexical ordering problem on a 0–1 i by j matrix which runs in O( ij ) time. This improves the time bounds for determining whether a dense 0–1 matrix is totally balanced, and determining whether a dense graph is strongly chordal or chordal bipartite.