论文信息 - Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem

Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem

This paper deals with the reconstruction of binary matrices having exactly - 1 - 4 - adjacency constraints from the horizontal and vertical projections. Such a problem is shown to be non polynomial by means of a reduction which involves the classic NP-complete problem 3- color. The result is reached by bijectively mapping all the four different cells involved in 3-color into maximal configurations of 0s and 1s which show the adjacency constraint, and which can be merged into a single binary matrix.

[1] Marek Chrobak,et al. On tiling under tomographic constraints , 2003, Theor. Comput. Sci..

[2] Fethi Jarray. Résolution de problèmes de tomographie discrète : application à la planification du personnel , 2004 .

[3] G. Herman,et al. Discrete tomography : foundations, algorithms, and applications , 1999 .

[4] H. Ryser. Combinatorial Properties of Matrices of Zeros and Ones , 1957, Canadian Journal of Mathematics.

[5] Marek Chrobak,et al. Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three Atoms , 1998, MFCS.

[6] Marek Chrobak,et al. A Note on Tiling under Tomographic Constraints , 2001, ArXiv.

[7] G. Herman,et al. Advances in discrete tomography and its applications , 2007 .

[8] Marek Chrobak,et al. Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms , 2001, Theor. Comput. Sci..

[9] Fethi Jarray,et al. Reconstruction of binary matrices under adjacency constraints , 2005, Electron. Notes Discret. Math..

[10] Attila Kuba,et al. Advances in Discrete Tomography and Its Applications (Applied and Numerical Harmonic Analysis) , 2007 .

[11] Fethi Jarray,et al. Reconstruction of binary matrices under adjacency constraints , 2005 .

[12] H. Ryser. Combinatorial Mathematics: THE PRINCIPLE OF INCLUSION AND EXCLUSION , 1963 .