Reduction from three-dimensional discrete tomography to multicommodity flow problem

DOI10.1016/J.TCS.2005.08.016MaRDI QIDQ2581349zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 10 January 2006

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2005.08.016

zbMATH Keywords

Flow-max problemInteger multicommodity flow problemMultiset

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Programming involving graphs or networks (90C35)

Recommendations

• Network flow algorithms for discrete tomography
• On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional X-rays
• Computational complexity of three-dimensional discrete tomography with missing data
• A convergent composite mapping Fourier domain iterative algorithms for 3-D discrete tomography
• A solvable case of image reconstruction in discrete tomography

Cites work

• A theorem on flows in networks
• Combinatorial Properties of Matrices of Zeros and Ones
• Discrete tomography. Foundations, algorithms, and applications
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• Network flows. Theory, algorithms, and applications.
• On the Complexity of Timetable and Multicommodity Flow Problems

Cited in

(1)

• Network flow algorithms for discrete tomography

This page was built for publication: Reduction from three-dimensional discrete tomography to multicommodity flow problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581349)