Back to Results
First PageMeta Content
Network flow / Combinatorial optimization / Flow network / Operations research / Maximum flow problem / Cut / FordFulkerson algorithm / Minimum cut / Shortest path problem / Planar graph / Split / Topology


In IEEE Transactions on PAMI, Vol. 26, No. 9, pp, Septp.1 An Experimental Comparison of Min-Cut/Max-Flow Algorithms for
Add to Reading List

Document Date: 2004-08-04 12:47:16


Open Document

File Size: 614,62 KB

Share Result on Facebook