On a graph coloring problem arising from discrete tomography

Networks

Volumn 51, Issue 4, 2008, Pages 256-267

  Bentz, C ^a   Costa, M C ^a   De Werra, D ^b   Picouleau, C ^a   Ries, B ^b  

^a Bioinformatique et Chimie Moléculaire   (France)

^b EPFL   (Switzerland)

Author keywords

Discrete tomography; Edge coloring; Family of chains; Scheduling; Vertex coloring

Indexed keywords

DIAGNOSTIC RADIOGRAPHY; IMAGE PROCESSING; IMAGE RECONSTRUCTION; MEDICAL IMAGING;

DISCRETE TOMOGRAPHY; EDGE COLORING; FAMILY OF CHAINS; SCHEDULING; VERTEX COLORING;

TOMOGRAPHY;

EID: 43949104145     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20218     Document Type: Article

References (15)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows, Prentice-Hall, Englewood Cliffs, 1993.
2. B. Aspvall, M.F. Plass, and R. Tarjan, A linear-time algorithm for testing the truth of certian quantified Boolean formulas, Informat Process Lett 8 (1979), 121-123.
3. C. Berge, Graphes, Gauthier-Villars, Paris, 1983.
4. M. Chrobak and C. Dürr, Reconstructing polyatomic structures from X-rays: NP-completness proof for three atoms, Theor Comput Sci 259 (2001), 81-98.
5. M.-C Costa, D. de Werra, and C. Picouleau, Using graphs for some discrete tomography problems, Discrete Appl Math 154 (2006), 35-46.
6. M.-C. Costa, D. de Werra, C. Picouleau, and D. Schindl, A solvable case of image reconstruction in discrete tomography, Discrete Appl Math 148 (2005), 240-245.
7. D. de Werra and J. Erschler, Open shop scheduling with some additional constraints, Graphs Combinat 12 (1996), 81-93.
8. M.R. Garey and D.S. Johnson, Computers and intractability, a guide to the theory of NP-completeness, Freeman, New York, 1979.
9. P. Hansen and D. de Werra, Nesticity, DIMACS Ser Discrete Math Theor Comput Sci 37 (1997), 225-232.
10. I. Holyer, NP-completeness of edge-coloring, SIAM J Comput 10 (1981), 718-720.
11. J. Kratochvil, Precoloring extension with fixed color bound, Acta Math Univ Comenianae LXIII 1 (1994), 139-153.
12. A. Kuba and G.T. Hermann, Discrete tomography: Foundations, algorithms and applications, Birkhäuser, Boston, 1999.
13. L. Lovasz and M. Plummer, Matching theory, North Holland, New York, 1986.
14. D. Marx, NP-completeness of list coloring and precoloring extension on the edges of planar graphs, J Graph Theory 49 (2005), 312-324.
15. H.J. Ryser, Combinatorial properties of matrices of zeros and ones, Can J Math 9 (1957), 371-377.