Using graphs for some discrete tomography problems

DOI10.1016/J.DAM.2005.07.003MaRDI QIDQ2581557zbMATH OpenOpenAlexFDO

Authors Marie-Christine Costa, Dominique De Werra, Christophe Picouleau

Publication date 10 January 2006

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2005.07.003

zbMATH Keywords

Complete bipartite graphsDiscrete tomographyEdge coloringPerfect matchingsTimetabling

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Applications of graph theory to circuits and networks (94C15)

Recommendations

• On a graph coloring problem arising from discrete tomography
• On the use of graphs in discrete tomography
• On the use of graphs in discrete tomography
• A solvable case of image reconstruction in discrete tomography
• Degree-constrained edge partitioning in graphs arising from discrete tomography

Cites work

• Discrete tomography. Foundations, algorithms, and applications
• scientific article; zbMATH DE number 3182201 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• Matchings in colored bipartite networks
• On the Complexity of Timetable and Multicommodity Flow Problems
• On the computational complexity of determining polyatomic structures by X-rays
• Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms

Cited in

(19)

• Handling fairness issues in time-relaxed tournaments with availability constraints
• Path puzzles: discrete tomography with a path constraint is hard
• A solvable case of image reconstruction in discrete tomography
• Solving problems of discrete tomography application in workforce scheduling
• Solving the two color problem: an heuristic algorithm
• Approximating Bicolored Images from Discrete Projections
• Tomography on Finite Graphs
• Reconstructing binary matrices with timetabling constraints
• On a graph coloring problem arising from discrete tomography
• Degree-constrained edge partitioning in graphs arising from discrete tomography
• Solving some instances of the 2-color problem
• On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition
• On the use of graphs in discrete tomography
• On the use of graphs in discrete tomography
• Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
• A reconstruction algorithm for a subclass of instances of the 2-color problem
• New sufficient conditions on the degree sequences of uniform hypergraphs
• Analysis on the strip-based projection model for discrete tomography
• Reconstruction of binary matrices under fixed size neighborhood constraints

This page was built for publication: Using graphs for some discrete tomography problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581557)