Computational geometry: an introduction
Computational geometry: an introduction
A data structure for dynamic trees
Journal of Computer and System Sciences
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
The lattice structure of flow in planar graphs
SIAM Journal on Discrete Mathematics
Finding $k$ Disjoint Paths in a Directed Planar Graph
SIAM Journal on Computing
Maximum (s,t)-flows in planar networks in O(|V| log |V|) time
Journal of Computer and System Sciences
Maximum flows and parametric shortest paths in planar graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Efficient algorithms for simplifying flow networks
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
A framework for path-oriented network simplification
IDA'10 Proceedings of the 9th international conference on Advances in Intelligent Data Analysis
Simplification of networks by edge pruning
Bisociative Knowledge Discovery
| Hi-index | 0.00 |
Maximum flow problems appear in many practical applications. In this paper, we study how to simplify a given directed flow network by finding edges that can be removed without changing the value of the maximum flow. We give a number of approaches which are increasingly more complex and more time-consuming, but in exchange they remove more and more edges from the network.