A reconstruction algorithm for a subclass of instances of the 2-color problem
Authors:
- S. BrocchiSBS. Brocchi
- A. FrosiniAFA. Frosini
- S. RinaldiSRS. Rinaldi
- 1 August 2011
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 412 (36) , 4795-4804
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On the use of graphs in discrete tomographyAnnals of Operations Research, 2009
- Reconstruction of binary matrices under fixed size neighborhood constraintsTheoretical Computer Science, 2008
- Using graphs for some discrete tomography problemsDiscrete Applied Mathematics, 2006
- A solvable case of image reconstruction in discrete tomographyDiscrete Applied Mathematics, 2005
- Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atomsTheoretical Computer Science, 2001
- On the computational complexity of determining polyatomic structures by X-raysTheoretical Computer Science, 2000
- On the computational complexity of reconstructing lattice sets from their X-raysDiscrete Mathematics, 1999
- An approach to quantitative high-resolution transmission electron microscopy of crystalline materialsUltramicroscopy, 1995
- Mapping projected potential, interfacial roughness, and composition in general crystalline solids by quantitative transmission electron microscopyPhysical Review Letters, 1993
- Combinatorial Properties of Matrices of Zeros and OnesCanadian Journal of Mathematics, 1957