Pages that link to "Item:Q3639290"

The following pages link to Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard (Q3639290):

Displayed 8 items.

• 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)
• Reconstructing \(hv\)-convex multi-coloured polyominoes (Q986548) ‎ (← links)
• Packing of graphic n-tuples (Q2888877) ‎ (← links)
• Solving the Two Color Problem: An Heuristic Algorithm (Q3003544) ‎ (← links)
• Approximating Bicolored Images from Discrete Projections (Q3003545) ‎ (← links)
• Solving Some Instances of the 2-Color Problem (Q3648811) ‎ (← links)
• On the use of graphs in discrete tomography (Q5900894) ‎ (← links)