Solving the Two Color Problem: An Heuristic Algorithm
From MaRDI portal
Publication:3003544
DOI10.1007/978-3-642-21073-0_27zbMath1330.68293OpenAlexW1579019069MaRDI QIDQ3003544
Stefano Brocchi, Elena Barcucci, Andrea Frosini
Publication date: 27 May 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21073-0_27
Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (2)
Reconstructing binary matrices with timetabling constraints ⋮ On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition
Cites Work
- Unnamed Item
- Reconstruction of binary matrices under fixed size neighborhood constraints
- Invariant sets of arcs in network flow problems
- Switching components and the ambiguity problem in the reconstruction of pictures from their projections
- On the computational complexity of determining polyatomic structures by X-rays
- Discrete tomography. Foundations, algorithms, and applications
- A solvable case of image reconstruction in discrete tomography
- Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.
- Combinatorial Properties of Matrices of Zeros and Ones
- Degree-constrained edge partitioning in graphs arising from discrete tomography
- Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
- Solving Some Instances of the 2-Color Problem
- Three-dimensional Statistical Data Security Problems
- Discrete tomography: Determination of finite sets by X-rays
- Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
This page was built for publication: Solving the Two Color Problem: An Heuristic Algorithm
