On the use of graphs in discrete tomography

DOI10.1007/s10288-008-0077-5zbMath1142.94309OpenAlexW2014535770MaRDI QIDQ5900257

Bernard Ries, Christophe Picouleau, Dominique de Werra, Marie-Christine Costa

Publication date: 4 September 2008

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://infoscience.epfl.ch/record/114988/files/10288_2008_Article_77.pdf

zbMATH Keywords

schedulingedge coloringcomplete bipartite graphtimetablingdiscrete tomographyconstrained coloring

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Biomedical imaging and signal processing (92C55) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Colour degree matrices of graphs with at most one cycle ⋮ Twelve surveys in operations research ⋮ On the approximability of the maximum interval constrained coloring problem ⋮ Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem ⋮ Surveys in operations research ⋮ On the use of graphs in discrete tomography ⋮ Mathematical optimization in intensity modulated radiation therapy

Cites Work

• 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
• Graph coloring with cardinality constraints on the neighborhoods
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• A solvable case of image reconstruction in discrete tomography
• Using graphs for some discrete tomography problems
• 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
• 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
• 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