On complexity of realization of Boolean matrices with connected boundary

DOI10.1515/DMA.1995.5.1.1zbMath0836.68082OpenAlexW1989704175MaRDI QIDQ4857008

No author found.

Publication date: 15 January 1996

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.1995.5.1.1

zbMATH Keywords

Boolean matrixShannon functions

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Boolean functions (06E30)

This page was built for publication: On complexity of realization of Boolean matrices with connected boundary