Pages that link to "Item:Q5900257"
From MaRDI portal
The following pages link to On the use of graphs in discrete tomography (Q5900257):
Displaying 12 items.
- Colour degree matrices of graphs with at most one cycle (Q298973) (← links)
- Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem (Q617894) (← links)
- On the approximability of the maximum interval constrained coloring problem (Q1662109) (← links)
- Surveys in operations research (Q1730527) (← links)
- Path puzzles: discrete tomography with a path constraint is hard (Q2308497) (← links)
- Solving problems of discrete tomography application in workforce scheduling (Q2507504) (← links)
- Using graphs for some discrete tomography problems (Q2581557) (← links)
- Twelve surveys in operations research (Q2630815) (← links)
- Tomography on Finite Graphs (Q3439188) (← links)
- On a graph coloring problem arising from discrete tomography (Q3515882) (← links)
- On the use of graphs in discrete tomography (Q5900894) (← links)
- Mathematical optimization in intensity modulated radiation therapy (Q5902146) (← links)