A solvable case of image reconstruction in discrete tomography

Discrete Applied Mathematics

Volumn 148, Issue 3, 2005, Pages 240-245

  Costa, M C ^a   De Werra, D ^b   Picouleau, C ^a   Schindl, D ^c  

^a Bioinformatique et Chimie Moléculaire   (France)

^b EPFL   (Switzerland)

^c GERAD   (Canada)

Author keywords

Complete bipartite graph; Discrete tomography; Edge coloring; Perfect matchings

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PARAMETER ESTIMATION; POLYNOMIALS; PROBLEM SOLVING; TOMOGRAPHY;

COMPLETE BIPARTITE GRAPH; DISCRETE TOMOGRAPHY; EDGE COLORING; PERFECT MATCHING;

IMAGE RECONSTRUCTION;

EID: 19944388606     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.03.006     Document Type: Article

References (7)

1. R. Ahuja, T.L. Magnanti, and J.B. Orlin Network Flows 1993 Prentice-Hall London
2. C. Berge Graphes et Hypergraphes 1970 Dunod Paris
3. M. Chrobak, and C. Dürr Reconstruction polyatomic structures from discrete X-rays NP-completeness proof for three atoms Theoret. Comput. Sci. 259 2001 81 98
4. M.C. Costa, D. de Werra, C. Picouleau, Using graphs for some discrete tomography problems, CEDRIC report, http://cedric.cnam/fr/, 2004.
5. M.R. Garey, and D.S. Johnson Computers and Intractability A Guide to the Theory of NP-completeness 1979 Freeman New Jersey
6. G. Herman, A. Kuba (Eds.), Discrete Tomography: Foundations, Algorithms and Applications, Birkhauser, Basel, 1999.
7. H. Ryser Combinatorial Mathematics 1963 Mathematical Association of America and Quinn & Boden Rahway, NJ