Using graphs for some discrete tomography problems
From MaRDI portal
Publication:2581557
DOI10.1016/j.dam.2005.07.003zbMath1079.94003OpenAlexW2077967369MaRDI QIDQ2581557
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
Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Coloring of graphs and hypergraphs (05C15) Applications of graph theory to circuits and networks (94C15)
Related Items (13)
New sufficient conditions on the degree sequences of uniform hypergraphs ⋮ Reconstructing binary matrices with timetabling constraints ⋮ 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 ⋮ Approximating Bicolored Images from Discrete Projections ⋮ Analysis on the strip-based projection model for discrete tomography ⋮ Reconstruction of binary matrices under fixed size neighborhood constraints ⋮ 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 ⋮ Handling fairness issues in time-relaxed tournaments with availability constraints ⋮ Solving Some Instances of the 2-Color Problem ⋮ On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition
Cites Work
- On the computational complexity of determining polyatomic structures by X-rays
- Discrete tomography. Foundations, algorithms, and applications
- Matchings in colored bipartite networks
- On the Complexity of Timetable and Multicommodity Flow Problems
- Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Using graphs for some discrete tomography problems
