A Greedy Algorithm for Reconstructing Binary Matrices with Adjacent 1s

DOI10.1007/978-3-319-59108-7_27zbMath1486.68235OpenAlexW2614475456MaRDI QIDQ5077686

Ghassen Tlig, Fethi Jarray

Publication date: 18 May 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-59108-7_27

zbMATH Keywords

NP-completenesspolynomial-time algorithmdiscrete objectsbinary matrices reconstruction

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computing methodologies for image processing (68U10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Boolean and Hadamard matrices (15B34)

This page was built for publication: A Greedy Algorithm for Reconstructing Binary Matrices with Adjacent 1s