On the use of graphs in discrete tomography
Publication:5900894
DOI10.1007/S10479-009-0649-6zbMath1185.05039OpenAlexW2020370390MaRDI QIDQ5900894
Bernard Ries, Dominique de Werra, Marie-Christine Costa, Christophe Picouleau
Publication date: 10 May 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://doc.rero.ch/record/321730/files/10288_2008_Article_77.pdf
Applications of graph theory (05C90) Computing methodologies for image processing (68U10) Deterministic scheduling theory in operations research (90B35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A MIP flow model for crop-rotation planning in a context of forest sustainable development
- Special issue: IWCIA 2003. Selected papers based on the presentation at the 9th international workshop on combinatorial image analysis, Palermo, Italy, May 14--16, 2003.
- Reconstruction of binary matrices under fixed size neighborhood constraints
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Discrete tomography. Foundations, algorithms, and applications
- A solvable case of image reconstruction in discrete tomography
- Using graphs for some discrete tomography problems
- 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
- On a graph coloring problem arising from discrete tomography
- Degree-constrained edge partitioning in graphs arising from discrete tomography
- Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
- The NP-Completeness of Edge-Coloring
- On the Complexity of Timetable and Multicommodity Flow Problems
- Reconstruction Algorithm and Switching Graph for Two-Projection Tomography with Prohibited Subregion
- On the use of graphs in discrete tomography
- Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
This page was built for publication: On the use of graphs in discrete tomography
