Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Reconstruction of binary matrices under fixed size neighborhood constraints
Theoretical Computer Science
Solving some instances of the 2-color problem
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem
Discrete Applied Mathematics
Hi-index | 0.05 |
A graph-theoretical model is used to show that a special case of image reconstruction problem (with 3 colors) can be solved in polynomial time.For the general case with 3 colors, the complexity status is open. Here we consider that among the three colors there is one for which the total number of multiple occurrences in a same line (row or column) is bounded by a fixed parameter. There is no assumption on the two remaining colors.