Results 291 to 300 of about 477,458 (300)
Some of the next articles are maybe not open access.
Minimum s-t Cut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time
SIAM Journal on Computing, 1983John H Reif
exaly
A new?old algorithm for minimum-cut and maximum-flow in closure graphs
Networks, 2001Dorit S Hochbaum
exaly
A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem
Algorithmica, 2004Dorit S Hochbaum +2 more
exaly
The line index and minimum cut of weighted graphs
European Journal of Operational Research, 1998exaly
High-precision ultra-fast minimum cut approximation through aggregated hash of cut collection
Chaos, Solitons and Fractalsexaly

