Doubly lexical ordering of dense 0–1 matrices

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.

Saved in:
Bibliographic Details
Published inInformation processing letters Vol. 45; no. 5; pp. 229 - 235
Main Author Spinrad, Jeremy P.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 02.04.1993
Elsevier Science
Elsevier Sequoia S.A
Subjects
Algorithms
analysis of algorithms
Applied sciences
chordal bipartite graphs
combinatorial problems
doubly lexical ordering
Exact sciences and technology
Flows in networks. Combinatorial problems
Graphs
Information processing
Operational research and scientific management
Operational research. Management science
strongly chordal graphs
Studies
Theory
totally balanced matrix
combinatorial problems
chordal bipartite graphs
Algorithms
analysis of algorithms
doubly lexical ordering
totally balanced matrix
strongly chordal graphs
Doubly lexical ordering
Bipartite graph
Algorithm
Algorithm analysis
Combinatory problem
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0020-0190
1872-6119
DOI:10.1016/0020-0190(93)90209-R