A reconstruction algorithm for a subclass of instances of the 2-color problem

DOI10.1016/J.TCS.2010.08.004MaRDI QIDQ638558zbMATH OpenOpenAlexFDO

Authors Stefano Brocchi, Andrea Frosini, S. Rinaldi

Publication date 12 September 2011

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2010.08.004

zbMATH Keywords

discrete tomographypolynomial time algorithm\(c\)-color problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Biomedical imaging and signal processing (92C55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Solving some instances of the 2-color problem
• Solving the two color problem: an heuristic algorithm
• Solving multicolor discrete tomography problems by using prior knowledge
• Approximating Bicolored Images from Discrete Projections
• A solvable case of image reconstruction in discrete tomography

Cites work

• A solvable case of image reconstruction in discrete tomography
• Combinatorial Properties of Matrices of Zeros and Ones
• On the computational complexity of determining polyatomic structures by X-rays
• On the computational complexity of reconstructing lattice sets from their X-rays
• On the use of graphs in discrete tomography
• Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
• Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
• Reconstruction of binary matrices under fixed size neighborhood constraints
• Using graphs for some discrete tomography problems

Cited in

(7)

• Solving the two color problem: an heuristic algorithm
• New sufficient conditions on the degree sequences of uniform hypergraphs
• Solving some instances of the 2-color problem
• A formulation of the wide partition conjecture using the atom problem in discrete tomography
• On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition
• Solving multicolor discrete tomography problems by using prior knowledge
• Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard: A solution to the 2-atom problem in discrete tomography

This page was built for publication: A reconstruction algorithm for a subclass of instances of the 2-color problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q638558)