On the use of graphs in discrete tomography
- 5 November 2009
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 175 (1) , 287-307
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- A MIP flow model for crop-rotation planning in a context of forest sustainable developmentAnnals of Operations Research, 2009
- Degree-constrained edge partitioning in graphs arising from discrete tomographyJournal of Graph Algorithms and Applications, 2009
- Reconstruction of binary matrices under fixed size neighborhood constraintsTheoretical Computer Science, 2008
- Network Flow Algorithms for Discrete Tomography2008
- Discrete Tomography Methods for Nondestructive Testing2008
- Discrete Tomography for Generating Grain Maps of Polycrystals2008
- On a graph coloring problem arising from discrete tomographyNetworks, 2007
- Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atomsTheoretical Computer Science, 2001
- Network Flows1988
- A linear-time algorithm for testing the truth of certain quantified boolean formulasInformation Processing Letters, 1979