Pages that link to "Item:Q2581557"
From MaRDI portal
The following pages link to Using graphs for some discrete tomography problems (Q2581557):
Displaying 18 items.
- Reconstructing binary matrices with timetabling constraints (Q350725) (← links)
- Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem (Q617894) (← links)
- A reconstruction algorithm for a subclass of instances of the 2-color problem (Q638558) (← links)
- New sufficient conditions on the degree sequences of uniform hypergraphs (Q831139) (← links)
- Analysis on the strip-based projection model for discrete tomography (Q947121) (← links)
- Reconstruction of binary matrices under fixed size neighborhood constraints (Q952456) (← links)
- Handling fairness issues in time-relaxed tournaments with availability constraints (Q2289924) (← links)
- Path puzzles: discrete tomography with a path constraint is hard (Q2308497) (← links)
- A solvable case of image reconstruction in discrete tomography (Q2486067) (← links)
- Solving problems of discrete tomography application in workforce scheduling (Q2507504) (← links)
- Approximating Bicolored Images from Discrete Projections (Q3003545) (← links)
- Tomography on Finite Graphs (Q3439188) (← links)
- On a graph coloring problem arising from discrete tomography (Q3515882) (← links)
- Degree-constrained edge partitioning in graphs arising from discrete tomography (Q3627968) (← links)
- Solving Some Instances of the 2-Color Problem (Q3648811) (← links)
- On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition (Q5237060) (← links)
- On the use of graphs in discrete tomography (Q5900257) (← links)
- On the use of graphs in discrete tomography (Q5900894) (← links)
