A tutorial on the use of graphs in discrete tomography

• Published in: 4OR, vol. 6, p. 101-123
• Publication date: 2008

Starting from the basic image reconstruction problem in discrete tomography some graph theoretical models are proposed. This suggests the study of some variations and extensions of the basic problem. Applications in scheduling and timetabling are described. We exhibit polynomially solvable cases and we review the complexity status of some related problems.

Note: Invited Paper

Keywords: discrete tomography ; complete bipartite graph ; edge coloring ; timetabling ; constrained coloring ; scheduling

Reference

• ROSE-ARTICLE-2007-005
• doi:10.1007/s10288-008-0077-5
• View record in Web of Science

Record created on 2007-12-17, modified on 2012-03-20