New sufficient conditions on the degree sequences of uniform hypergraphs
The study of the degree sequences of k-uniform hypergraphs, usually called k-sequences,
has been a longstanding open problem for the case of k> 2, and the corresponding decision …
has been a longstanding open problem for the case of k> 2, and the corresponding decision …
[HTML][HTML] Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem
We consider the problem of coloring a grid using p colors with the requirement that each row
and each column has a specific total number of entries of each color. Ryser (1957)[20], and …
and each column has a specific total number of entries of each color. Ryser (1957)[20], and …
Reconstruction of binary matrices under fixed size neighborhood constraints
Using a dynamic programming approach, we prove that a large variety of matrix
reconstruction problems from two projections can be solved in polynomial time whenever …
reconstruction problems from two projections can be solved in polynomial time whenever …
On the use of graphs in discrete tomography
D de Werra, MC Costa, C Picouleau, B Ries - 4OR, 2008 - Springer
In this tutorial paper, we consider the basic image reconstruction problem which stems from
discrete tomography. We derive a graph theoretical model and we explore some variations …
discrete tomography. We derive a graph theoretical model and we explore some variations …
On a graph coloring problem arising from discrete tomography
C Bentz, MC Costa, D De Werra… - Networks: An …, 2008 - Wiley Online Library
An extension of the basic image reconstruction problem in discrete tomography is
considered: given a graph G=(V, E) and a family P of chains Pi together with vectors h …
considered: given a graph G=(V, E) and a family P of chains Pi together with vectors h …
Solving the two color problem: an heuristic algorithm
The 2-color problem in discrete tomography requires to construct a 2-colored matrix
consistent with a given set of projections representing the number of elements of each color …
consistent with a given set of projections representing the number of elements of each color …
Solving multicolor discrete tomography problems by using prior knowledge
E Barcucci, S Brocchi - Fundamenta Informaticae, 2013 - content.iospress.com
Discrete tomography deals with the reconstruction of discrete sets with given projections
relative to a limited number of directions, modeling the situation where a material is studied …
relative to a limited number of directions, modeling the situation where a material is studied …
A reconstruction algorithm for a subclass of instances of the 2-color problem
In the field of Discrete Tomography, the 2-color problem consists in reconstructing a matrix
whose elements are of two different types, starting from its horizontal and vertical …
whose elements are of two different types, starting from its horizontal and vertical …
[HTML][HTML] Colour degree matrices of graphs with at most one cycle
A Hillebrand, C McDiarmid - Discrete Applied Mathematics, 2016 - Elsevier
Colour degree matrix problems, also known as edge-disjoint realisation and edge packing
problems, have connections for example to discrete tomography. Necessary and sufficient …
problems, have connections for example to discrete tomography. Necessary and sufficient …
Discrete tomography reconstruction algorithms for images with a blocking component
We study a problem involving the reconstruction of an image from its horizontal and vertical
projections in the case where some parts of these projections are unavailable. The desired …
projections in the case where some parts of these projections are unavailable. The desired …