Using graphs for some discrete tomography problems

Discrete Applied Mathematics

Volumn 154, Issue 1, 2006, Pages 35-46

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

^a Bioinformatique et Chimie Moléculaire   (France)

^b EPFL   (Switzerland)

Author keywords

Complete bipartite graphs; Discrete tomography; Edge coloring; Perfect matchings; Timetabling

Indexed keywords

COMPUTATIONAL COMPLEXITY; FINITE DIFFERENCE METHOD; IMAGE RECONSTRUCTION; TOMOGRAPHY;

COMPLETE BIPARTITE GRAPHS; DISCRETE TOMOGRAPHY; EDGE COLORING; PERFECT MATCHINGS; TIMETABLING;

GRAPH THEORY;

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

References (8)

1. C. Berge Graphes 1983 Gauthier-Villars Paris
2. M. Chrobak, and C. Dürr Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms Theoret. Comput. Sci. 259 1-2 2001 81 98
3. S. Even, A. Itai, and R. Shamir On the complexity of timetable and multicommodity flows problems SIAM J. Comput. 5 1976 691 703
4. R.J. Gardner, P. Gritzmann, and D. Prangenberg On the computational complexity of determining polyatomic structures by X-rays Theoret. Comput. Sci. 233 2000 91 106
5. M.R. Garey, and D.S. Johnson Computers and Intractability, a Guide to the Theory of NP-Completeness 1979 Freeman New York
6. G. Herman, and A. Kuba Discrete Tomography: Foundations, Algorithms and Applications 1999 Birkhauser Basel
7. H. Ryser Combinatorial Mathematics 1963 Mathematical Association of America, Quinn & Boden Rahway, NJ
8. T. Yi, K.G. Murty, and C. Spera Matchings in colored bipartite networks Discrete Appl. Math. 121 2002 261 277