Flows in Networks

By Eric V. Denardo. 2011

1,639 citations recorded by the source corpus.

Subfields: Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/a0e123965280bc71c376dfc1747c17460aee3ca6

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Industrial and Manufacturing Engineering

Citations in the corpus

Vehicle routing under time-dependent travel times: The impact of congestion avoidance (2012, methodology): “Calculating exact travel times with Strategy 4 would require a different shortest path algorithm with a higher complexity than with the other strategies (Orda and Rom [16] show that calculating time-dependent shortest paths for a given departure time can be done with a standard Dijkstra [17] search,”
Ensemble Video Object Cut in Highly Dynamic Scenes (2013, methodology): “One typical approach to solve the max-flow problem is to use augmenting paths [6], for which fast algorithms are available [4] with linear running time.”
Diagonal preconditioning for first order primal-dual algorithms in convex optimization (2011, background): “The well-known Ford and Fulkerson theorem [9] states that the maximum flow will saturate a set of edges that will partition the graph into two disjoint sets connected to the source and sink.”
Vital nodes identification in complex networks (2016, background): “The famous min-cut, max-flow theorem proved that the maximum flow from vs to vt exactly equals the minimum cut capacity [81, 82].”
A review of multimodal image matching: Methods and applications (2021, background): “Representative ones are graph-based [77], message passing [78], and linear programming methods [79,80].”
Assembling Single-Cell Genomes and Mini-Metagenomes From Chimeric MDA Products (2013, neutral): “The circulation problem is to ﬁnd a circulation in a network (Ford and Fulkerson, 1962).”
StringTie enables improved reconstruction of a transcriptome from RNA-seq reads (2015, background): “It has been shown in the literature that this problem can be reduced to a standard maximum flow problem 31 .”
Combinatorial optimization and reasoning with graph neural networks (2021, background): “Subsequent analyses have shown that this problem can be related to the minimum cut problem on graphs and can be shown equivalent to nding a maximal ow through the network; this follows directly from the subsequently proven max- ow min-cut theorem [41].”
The Algorithm Design Manual (2020, methodology): “The fundamental maximum-flow, minimum-cut theorem is due to Ford and Fulkerson [FF62].”
Assembling Genomes and Mini-metagenomes from Highly Chimeric Reads (2013, background): “The Circulation Problem is to find a circulation in a network [21].”
Optical flow modeling and computation: A survey (2015, background): “The basis of graph cuts is the max-ﬂow/min-cut problem consisting in ﬁnding the optimal path between two nodes in a directed graph, solvable by many algo-rithm in polynomial time [91,102].”