2013
DOI: 10.1016/j.jnca.2012.12.020
|View full text |Cite
|
Sign up to set email alerts
|

A survey of network flow applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
114
0
3

Year Published

2013
2013
2022
2022

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 218 publications
(124 citation statements)
references
References 116 publications
0
114
0
3
Order By: Relevance
“…In the corresponding PAproblem, we have arcs (x; y) 1 and (z; x) 1 with (cost, lower, upper) = (-1,0,1), arc (y; z) 1 with (cost, lower, upper) = (-1,0,3), arcs (x; y) 2 , (y; z) 2 , and (z; x) 2 with (cost, lower, upper) = (0,0,1), and arcs (x; y) 3 , (y; z) 3 , and (z; x) 3 with (cost,lower,upper) = (1; 0; 1). Then, we get a feasible ow by assigning ow of 1 unit on arcs (x; y) 1 , (x; y) 2 , (z; x) 1 , and (z; x) 2 , and 2 units on (y; z) 1 . The total cost is -4, which is minimum.…”
Section: Goldberg and Tarjan's Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…In the corresponding PAproblem, we have arcs (x; y) 1 and (z; x) 1 with (cost, lower, upper) = (-1,0,1), arc (y; z) 1 with (cost, lower, upper) = (-1,0,3), arcs (x; y) 2 , (y; z) 2 , and (z; x) 2 with (cost, lower, upper) = (0,0,1), and arcs (x; y) 3 , (y; z) 3 , and (z; x) 3 with (cost,lower,upper) = (1; 0; 1). Then, we get a feasible ow by assigning ow of 1 unit on arcs (x; y) 1 , (x; y) 2 , (z; x) 1 , and (z; x) 2 , and 2 units on (y; z) 1 . The total cost is -4, which is minimum.…”
Section: Goldberg and Tarjan's Algorithmmentioning
confidence: 99%
“…Such problems often involve few indivisible objects, and this leads to a nite set of feasible solutions. Li et al [1] presented a good survey of network ow applications. Some recent applications of network ows problem have been presented in [2][3][4][5][6][7][8][9][10].…”
Section: Introductionmentioning
confidence: 99%
“…To combat this, some researchers have turned to network flow applications (such as NetFlow, sFlow, OpenFlow and IPFIX) to cut down on data overheads with filtering, sampling, and flow aggregation techniques [55].…”
Section: Network Flow and Feature Selectionmentioning
confidence: 99%
“…Network management and intrusion detection systems heavily rely on automatically identifying communication behaviors [1], [2]. To keep up with new malware and changing usage patterns, models and detection rules must be updated regularly.…”
Section: Introductionmentioning
confidence: 99%