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

DOI10.1016/0012-365X(77)90051-6zbMATH Open0388.05003MaRDI QIDQ1250102FDOQ1250102

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

• Title not available (Why is that?)
• Paths, Trees, and Flowers
• Title not available (Why is that?)
• The complexity of theorem-proving procedures
• Widths and Heights of (0,1) -Matrices
• Multiplicities and Minimal Widths for (0, 1)-Matrices
• Width Sequences for Special Classes of (0, 1)-Matrices
• An Algorithm for a Minimum Cover of a Graph
• The 1-width of (0,1)-matrices having constant row sum 3
• Title not available (Why is that?)
• MAXIMAL DEPTH OF A CLASS OF $ (0,1)$-MATRICES
• Set Covering by an All Integer Algorithm
• An Algorithm for a Minimum Cover of an Abstract Complex

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)