|
 
|
[JT17] A Greedy Algorithm for Reconstructing Binary Matrices with Adjacent 1s
Conférence Internationale avec comité de lecture : Combinatorial Image Analysis: 18th International Workshop, IWCIA 2017, , June 2017, Vol. 10256, pp.20-30, Plovdiv, Bulgaria,
motcle:
Résumé:
This paper deals with the reconstruction of special cases of binary matrices with
adjacent 1s. Each element is horizontally adjacent to at least another element. The
projections are the number of elements on each row and column. We give a greedy
polynomial time algorithm to reconstruct such matrices when satisfying only the vertical
projection. We show also that the reconstruction is NP-complete when fixing the number of
sequence of length two and three per row and column.
BibTeX
| @inproceedings { | |||
| JT17, | |||
| title | = | "{A Greedy Algorithm for Reconstructing Binary Matrices with Adjacent 1s}", | |
| author | = | " F. Jarray and G. Tlig ", | |
| booktitle | = | "{Combinatorial Image Analysis: 18th International Workshop, IWCIA 2017, }", | |
| year | = | 2017, | |
| month | = | "June", | |
| volume | = | 10256, | |
| pages | = | "20-30", | |
| address | = | "Plovdiv, Bulgaria", | |
| } | |||
