Skip to main content
Conference ProceedingsOPEN ACCESS

DOUBLY LEXICAL ORDERINGS OF MATRICES.

Conference Proceedings of the Annual ACM Symposium on Theory of Computing (1985) 396-404
DOI: 10.1145/22145.22189
2Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

Abstract

A doubly lexical ordering of the rows and columns of any real-valued matrix is defined. This notion extends to graphs. These orderings are used to prove and unify results on several classes of matrices and graphs, including totally balanced matrices and chordal graphs. An almost-linear time doubly lexical ordering algorithm is given.

Cite

CITATION STYLE

APA

Lubiw, A. (1985). DOUBLY LEXICAL ORDERINGS OF MATRICES. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 396–404). ACM (Order n 508850). https://doi.org/10.1145/22145.22189

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free