Doubly Lexical Ordering of Dense 0 - 1 Matrices

Abstract

Spinrad. J.P., Doubly lexical ordering of dense O-l matrices. Information Processing Letters 45 (1993) 229-235. We present an algorithm for the doubly lexical ordering problem on a O-1 i by j matrix which runs in O(G) time. This improves the time bounds for determining whether a dense O-l matrix is totally balanced, and determining whether a dense graph is… (More)
DOI: 10.1016/0020-0190(93)90209-R

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.