The distribution of 1-widths of (0,1)-matrices

DOI10.1016/0012-365X(77)90051-6MaRDI QIDQ1250102zbMATH OpenFDO

Authors Clement Lam

Publication date 1978

Published in Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Cites work

• scientific article; zbMATH DE number 3182201 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3349863 (Why is no real title available?)
• An Algorithm for a Minimum Cover of a Graph
• An Algorithm for a Minimum Cover of an Abstract Complex
• MAXIMAL DEPTH OF A CLASS OF $ (0,1)$-MATRICES
• Multiplicities and Minimal Widths for (0, 1)-Matrices
• Paths, Trees, and Flowers
• Set Covering by an All Integer Algorithm
• The 1-width of (0,1)-matrices having constant row sum 3
• The complexity of theorem-proving procedures
• Width Sequences for Special Classes of (0, 1)-Matrices
• Widths and Heights of (0,1) -Matrices

Cited in

(2)

• How reliable is a computer-based proof?
• Combinatorial analysis. (Matrix problems, choice theory)

This page was built for publication: The distribution of 1-widths of (0,1)-matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1250102)