2011
DOI: 10.1016/j.dam.2011.06.030
|View full text |Cite
|
Sign up to set email alerts
|

Simplifying maximum flow computations: The effect of shrinking and good initial flows

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
4
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 18 publications
(6 citation statements)
references
References 12 publications
0
4
0
Order By: Relevance
“…The latter are of frequent interest in nanotomography, such as in the 3D investigation of porous supports for applications in heterogeneous catalysis 22 , particle chromatography 23 , fuel cells 24 or battery electrodes 25 . For homogeneous materials, reconstruction algorithms based on combinatorial optimization models have been presented in Liers and Pardella 26 . Since homogeneous materials consist of only one approximately constant density value (i.e., composition or material phase), they provide additional information that is known beforehand.…”
Section: Compressed Sensing Frameworkmentioning
confidence: 99%
See 1 more Smart Citation
“…The latter are of frequent interest in nanotomography, such as in the 3D investigation of porous supports for applications in heterogeneous catalysis 22 , particle chromatography 23 , fuel cells 24 or battery electrodes 25 . For homogeneous materials, reconstruction algorithms based on combinatorial optimization models have been presented in Liers and Pardella 26 . Since homogeneous materials consist of only one approximately constant density value (i.e., composition or material phase), they provide additional information that is known beforehand.…”
Section: Compressed Sensing Frameworkmentioning
confidence: 99%
“…25 For homogeneous materials, reconstruction algorithms based on combinatorial optimization models have been presented in Liers and Pardella. 26 Since homogeneous materials consist of only one approximately constant density value (i.e., composition or material phase), they provide additional information that is known beforehand. In particular, being composed of only one density value, these reconstructions are expected to exhibit either areas of said density or empty space (typically lled with vacuum or air), with only a few sharp edges in between.…”
Section: Compressed Sensing Frameworkmentioning
confidence: 99%
“…We present some techniques, based on [33] , to help shrink the size of the Event-Driven Graph. Shrinking this graph reduces memory consumption and makes the flow-maximization algorithm run faster.…”
Section: Vertex Shrinking and Edge Pruningmentioning
confidence: 99%
“…Based on [33] , this step is meant to speed up the max-flow algorithm. We traverse all vertices from the Event-Driven Graph; in each of them, we note the edge with maximum capacity leaving the node; and, if that capacity is larger than the summed capacity of all incoming edges, we reduce that outgoing capacity to the sum of the incoming edges.…”
Section: Event-driven Graph Capacity Normalizationmentioning
confidence: 99%
“…NF problem has permanently been among the research hotspots in operational research, graph theory and combinatorial optimisation [20]. The solution to this problem generally falls into two categories: the first is to constantly seek a path which can be augmented, and gradually increase the value of flow by adding up the minimum sub-path flow [21,22]; the second is to calculate maximum flow value indirectly by applying the minimum cut theorem [23,24].…”
Section: Research Articlementioning
confidence: 99%